AN IMPROVED ALGORITHM FOR THE DYNAMIC LOT-SIZING PROBLEM WITH LEARNING EFFECT IN SETUPS

Authors
MALIK K WANG YF
Citation
K. Malik et Yf. Wang, AN IMPROVED ALGORITHM FOR THE DYNAMIC LOT-SIZING PROBLEM WITH LEARNING EFFECT IN SETUPS, Naval research logistics, 40(7), 1993, pp. 925-931
Citations number
10
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Naval research logistics → ACNP
ISSN journal
0894069X
Volume
40
Issue
7
Year of publication
1993
Pages
925 - 931
Database
ISI
SICI code
0894-069X(1993)40:7<925:AIAFTD>2.0.ZU;2-F
Abstract
The dynamic lot-sizing problem with learning in setups is a variation of the Wagner-Whitin lot-sizing problem where the setup costs are a co ncave, nondecreasing function of the cumulative number of setups. This problem has been a subject of some recent research. We extend the pre viously studied model to include nonstationary production costs and pr esent an O(T-2) algorithm to solve this problem. The worst-case comple xity of our algorithm improves the worst-case behavior of the algorith ms presently known in the literature. (C) 1993 John Wiley & Sons, Inc.