A DYNAMIC LOT SIZING MODEL WITH LEARNING IN SETUPS

被引:40
作者
CHAND, S [1 ]
SETHI, SP [1 ]
机构
[1] UNIV TORONTO,FAC MANAGEMENT,TORONTO M5S 1A1,ONTARIO,CANADA
关键词
D O I
10.1287/opre.38.4.644
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper considers the dynamic lot sizing problem of H.M. Wagner and T.M. Whitin with the assumption that the total cost of n setups is a concave nondecreasing function of n. Such setup costs could arise from the worker learning in setups and/or technological improvements in setup methods. An efficient dynamic programming algorithm is developed to solve a finite horizon problem and results are presented to find decision/forecast horizons. Several new results presented in the paper have potential use in solving other related problems.
引用
收藏
页码:644 / 655
页数:12
相关论文
共 16 条
[1]   CONCEPTS OF FORECAST AND DECISION HORIZONS - APPLICATIONS TO DYNAMIC STOCHASTIC OPTIMIZATION PROBLEMS [J].
BES, C ;
SETHI, SP .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :295-310
[2]  
BHASKARAN S, 1987, OPTIM CONTR APPL MET, V8, P201, DOI 10.1002/oca.4660080303
[3]   DECISION FORECAST HORIZON RESULTS FOR A SINGLE FACILITY DYNAMIC LOCATION RELOCATION PROBLEM [J].
CHAND, S .
OPERATIONS RESEARCH LETTERS, 1988, 7 (05) :247-251
[5]   MINIMAL FORECAST HORIZON PROCEDURES FOR DYNAMIC LOT SIZE MODELS [J].
CHAND, S ;
MORTON, TE .
NAVAL RESEARCH LOGISTICS, 1986, 33 (01) :111-122
[6]  
Chand S., 1982, Decision Sciences, V13, P113, DOI 10.1111/j.1540-5915.1982.tb00134.x
[7]   PLANNING HORIZON PROCEDURES FOR MACHINE REPLACEMENT MODELS WITH SEVERAL POSSIBLE REPLACEMENT ALTERNATIVES [J].
CHAND, S ;
SETHI, S .
NAVAL RESEARCH LOGISTICS, 1982, 29 (03) :483-493
[8]  
CHAND S, 1990, IN PRESS OPNS RES
[9]  
KARWAN KR, 1988, NAV RES LOG, V35, P159, DOI 10.1002/1520-6750(198804)35:2<159::AID-NAV3220350202>3.0.CO
[10]  
2-1