The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times

Computers and Operations Research

Volumn 32, Issue 4, 2005, Pages 727-747

  Gupta, Diwakar ^a   Magnusson, Thorkell ^b  

^a University of Minnesota   (United States)

^b NONE   (Iceland)

Author keywords

Heuristic; Lot sizing; Relaxation; Scheduling; Sequence dependent; Sequencing

Indexed keywords

APPROXIMATION THEORY; COST EFFECTIVENESS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

LOT-SIZING; RELAXATION; SEQUENCE-DEPENDENT; SEQUENCING;

OPERATIONS RESEARCH;

EID: 5644274147     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.08.014     Document Type: Article

References (24)

1. Bitran G.R., Gilbert S.M. Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost. Journal of Manufacturing and Operations Management. 3:1990;24-52.
2. Karmarkar U.S., Schrage L. The deterministic dynamic product cycling problem. Operations Research. 33:1985;326-345.
3. Constantino M. A cutting plane approach to capacitated lot-sizing with start-up costs. Mathematical Programming. 75:1996;353-376.
4. Fleischmann B. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research. 75:1994;395-404.
5. Salomon M., Solomon M.M., Van Wassenhove L.N., Duman Y., Duazère-Pérès S. Solving the discrete lot-sizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows. European Journal of Operational Research. 100(3):1997;494-513.
6. Wolsey L. A. MIP modeling of changeovers in production planning and scheduling problems. European Journal of Operational Research. 99:1997;154-165.
7. Laporte G. The traveling salesman problem. An overview of exact and approximate algorithms European Journal of Operational Research. 59:1992;231-247.
8. Laporte G. The vehicle routing problem. An overview of exact and approximate algorithms European Journal of Operational Research. 59:1992;345-358.
9. Eisenhut P.S. A dynamic lot sizing algorithm with capacity constraints. AIIE Transactions. 7(2):1975;170-176.
10. Lambrecht M., Vanderveken H. Heuristic procedures for the single operation, multi-item loading problem. AIIE Transactions. 11(4):1979;319-326.
11. Dogramaci A., Panayiotopoulos J.C., Adam N.R. The dynamic lot-sizing problem for multiple items under limited capacity. AIIE Transactions. 13(4):1981;294-303.
12. Thizy J.M., Van Wassenhove L.N. Lagrangean relaxation for the multi-item capacitated lot-sizing problem. A heuristic implementation IIE Transactions. 17(2):1985;64-74.
13. Barany I., Van Roy T.J., Wolsey L. Strong formulations for multi-item capacitated lot sizing. Management Science. 30(10):1984;1255-1261.
14. Trigeiro W.W., Thomas L.J., McClain J.O. Capacitated lot sizing with setup times. Management Science. 35(3):1989;353-366.
15. Roundy R. Rounding off to powers of two in continuous relaxations for capacitated lot sizing problems. Management Science. 35(12):1989;1433-1442.
16. Diaby M., Bahl H.C., Karwan M.H., Zionts S. Capacitated lot-sizing and scheduling by Lagrangean relaxation. European Journal of Operational Research. 59:1992;444-458.
17. Pratsini E., Camm J.D., Raturi A.S. Capacitated lot sizing under setup learning. European Journal of Operational Research. 72:1994;545-557.
18. Gopalakrishnan M., Miller D.M., Schmidt C.P. A framework for modeling setup carryover in the capacitated lot sizing problem. International Journal of Production Research. 33(7):1995;1973-1988.
19. Haase K. Capacitated lot-sizing with sequence-dependent setup costs. Operations Research Spectrum. 18:1996;51-59.
20. Kang S., Kavindra M., Thomas L.J. Lotsizing and scheduling on parallel machines with sequence dependent setup cost. Management Science. 45(2):1999;273-289.
21. Garey M, Johnson D. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman and Co, 1979. p. 47, p. 226.
22. Van Hentenryck P. The OPL optimization programming language reference manual. 1999;MIT Press, Cambridge.
23. Zipkin P.H. Bounds for row-aggregation in linear programming. Operations Research. 28:1979;903-916.
24. Alfieri A., Brandimarte P., D'Orazio S. LP-based heuristics for the capacitated lot-sizing problem. the interaction of model formulation and solution algorithm International Journal of Production Research. 40(2):2002;441-458.