Multiperiod production planning carrying over set-up time

International Journal of Production Research

Volumn 41, Issue 6, 2003, Pages 1133-1148

  Porkka, P ^a   Vepsalainen A P J ^a   Kuula, M ^a  

^a HELSINKI SCHOOL OF ECONOMICS   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; INVENTORY CONTROL; OPERATIONS RESEARCH; STRATEGIC PLANNING;

PRODUCTION PLANNING;

PRODUCTION CONTROL;

EID: 0242301580     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754021000042995     Document Type: Article

References (15)

1. BAHL, H. C., RITZMAN, L. P. and GUPTA, J. N. D., 1987, Determining lot sizes and resource requirements: a review. Operations Research, 35, 329-345.
2. BILLINGTON, P. J., 1983, Multi-level lot-sizing with a bottleneck work center. PhD dissertation, Graduate School of Business and Public Administration, Cornell University.
3. BILLINGTON, P. J., MCCLAIN, J. O. and THOMAS, L. J., 1983, Mathematical approaches to capacity-constrained MRP systems: review, formulation and problem reduction. Management Science, 29, 1126-1141.
4. DIABY, M., BAHL, H. C., KARWAN, M. H. and ZIONTS, S., 1992a,.A lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Science, 38, 1329-1340.
5. DIABY, M., BAHL, H. C., KARWAN, M. H. and ZIONTS, S., 1992b, Capacitated lot-sizing and scheduling by Lagrangean relaxation. European Journal of Operational Research, 38, 444-458.
6. GASCON, A. and LEACHMAN, R. C., 1988, A dynamic programing solution to the dynamic, multi-item, single-machine scheduling problem. Operations Research, 36, 50-56.
7. GLASSEY, C. R., 1968, Minimum change-over scheduling of several products on one machine. Operations Research, 16, 343-352.
8. GOPALAKRISHNAN, M., DING, K., BOURJOLLY, J. and MOHAN, S., 2001, A Tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science, 47, 851-863.
9. GOPALAKRISHNAN, M., MILLER, D. M. and SCHMIDT, C. P., 1995, A framework for modelling set-up carry-over in the capacitated lot sizing problem. International Journal of Production Research, 33, 1973-1988.
10. HAASE, K. 1996, Capacitated lot sizing with linked production quantities of adjacent periods. Working Paper 334, Institut für Betriebswirschaftslehre, Christian-Albrechts-Universität zu Kiel, Germany.
11. KARMARKAR, U. S. and SCHRAGE, L., 1985, The deterministic dynamic product cycling problem. Operations Research, 33, 326-345.
12. MAES, J. and VAN WASSENHOVE, L., 1988, Multi-item, single-level capacitated dynamic lot-sizing heuristics: a general review. Journal of the Operational Research Society 39, 991-1004.
13. PORKKA, P., 2000, Capacitated lot sizing problem with set-up time and set-up carry-over Case Raflatac Oy. Master's thesis, Helsinki School of Economics, Finland.
14. Sox, C. R. and GAO, Y., 1999, The capacitated lot sizing problem with set-up carry-over. IIE Transactions, 31, 173-181.
15. TRIGEIRO, W. W., THOMAS, L. J. and MCCLAIN, J. O., 1989, Capacitated lot sizing with setup times. Management Science, 35, 353-366.