Single machine multi-product capacitated lot sizing with sequence-dependent setups

International Journal of Production Research

Volumn 45, Issue 20, 2007, Pages 4873-4894

  Almada Lobo, Bernardo ^a,b   Klabjan, Diego ^b   Carravilla, Maria Antónia ^a,c   Oliveira, José F ^a,c  

^a UNIVERSITY OF PORTO   (Portugal)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INESC   (Portugal)

Author keywords

Capacitated lot sizing and scheduling; Heuristics; Integer programming; Sequence dependent setup

Indexed keywords

COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

CAPACITATED LOT SIZING; POLYNOMIAL TIME; SEQUENCE-DEPENDENT SETUP;

PRODUCTION ENGINEERING;

EID: 34548460398     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540601094465     Document Type: Article

References (18)

1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, 1993 (Prentice-Hall: Englewood Cliffs, NJ).
2. Almada-Lobo, B., Oliveira, J.F. and Carravilla, M.A., A note on 'The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times'. Comput. Oper. Res., 2006 (doi: 10.1016/j.cor.2006.08.019).
3. Barany, I., Vanroy, T.J. and Wolsey, L.A., Strong formulations for multi-item capacitated lot sizing. Mgmt Sci., 1984, 30, 1255-1261.
4. Clark, A.R. and Clark, S.J., Rolling-horizon lot-sizing when set-up times are sequence-dependent. Int. J. Prod. Res., 2000, 38, 2287-2307.
5. Drexl, A. and Kimms, A., Lot sizing and scheduling - survey and extensions. Eur. J. oper. Res., 1997, 99, 221-235.
6. Gopalakrishnan, M., A modified framework for modelling set-up carryover in the capacitated lotsizing problem. Int. J. Prod. Res., 2000, 38, 3421-3424.
7. Gopalakrishnan, M., Ding, K., Bourjolly, J.M. and Mohan, S., A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Mgmt Sci., 2001, 47, 851-863.
8. Gopalakrishnan, M., Miller, D.M. and Schmidt, C.P., A framework for modeling setup carryover in the capacitated lot-sizing problem. Int. J. Prod. Res., 1995, 33, 1973-1988.
9. Gupta, D. and Magnusson, T., The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput. Oper. Res., 2005, 32, 727-747.
10. Haase, K., Lot Sizing and Scheduling for Production Planning (Lecture Notes in Economics and Mathematical Systems), 1994 (Springer: Berlin).
11. Haase, K. and Kimms, A., Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int. J. Prod. Econ., 2000, 66, 159-169.
12. Hindi, K.S., Fleszar, K. and Charalambous, C., An effective heuristic for the CLSP with set-up times. J. oper. Res. Soc., 2003, 54, 490-498.
13. Kang, S., Malik, K. and Thomas, L.J., Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Mgmt Sci., 1999, 45, 273-289.
14. Nemhauser, G.L. and Wolsey, L.A., Integer and Combinatorial Optimization, 1988 (Wiley: New York).
15. Porkka, P., Vepsalainen, A.P.J. and Kuula, M., Multiperiod production planning carrying over set-up time. Int. J. Prod. Res., 2003, 41, 1133-1148.
16. Sox, C.R. and Gao, Y.B., The capacitated lot sizing problem with setup carry-over. IIE Trans., 1999, 31, 173-181.
17. Suerie, C. and Stadtler, H., The capacitated lot-sizing problem with linked lot sizes. Mgmt Sci., 2003, 49, 1039-1054.
18. Trigeiro, W.W., Thomas, L.J. and McClain, J.O., Capacitated lot-sizing with setup times. Mgmt Sci., 1989, 35, 353-366.