Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups

International Journal of Production Research

Volumn 48, Issue 3, 2010, Pages 861-878

  Almada Lobo, Bernardo ^a   James, Ross J W ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Linear programming; Logistics; Lot sizing; Meta heuristics; Operational research; Product planning; Scheduling

Indexed keywords

CAPACITATED LOT SIZING; COMMERCIAL SOLVERS; COMPUTATIONAL EXPERIMENT; FAST SEARCH; LOT SIZING; META HEURISTICS; METAHEURISTIC; MULTI-ITEM; NEIGHBOURHOOD SEARCH; NP-HARD PROBLEM; OPERATIONAL RESEARCH; PRODUCT PLANNING; PRODUCTION QUANTITY; SCHEDULING PROBLEM; SEQUENCE DEPENDENT SETUPS; SEQUENCE-DEPENDENT SETUP TIME; SOLUTION REPRESENTATION; VARIABLE NEIGHBOURHOOD SEARCH;

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; LINEARIZATION; SCHEDULING; TABU SEARCH;

HEURISTIC METHODS;

EID: 74549143166     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802446787     Document Type: Article

References (28)

1. Almada-Lobo, B., et al., 2007. Single machine multi-product capacitated lotsizing with sequence- dependent setups. International Journal of Production Research, 45 (20), 4873-4894.
2. Almada-Lobo, B., Oliveira, J.F., and Carravilla, M.A., 2008. A note on ''The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times''. Computers and Operations Research, 35 (4), 1374-1376.
3. Araujo, S.A., Arenales, N.M., and Clark, A.R., 2007. Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics, 13 (4), 337-358.
4. Barany, I., Vanroy, T.J., and Wolsey, L.A., 1984. Strong formulations for multi-item capacitated lot sizing. Management Science, 30 (10), 1255-1261.
5. Bruggemann, W. and Jahnke, H., 2000. The discrete lot-sizing and scheduling problem: complexity and modification for batch availability. European Journal of Operational Research, 124 (3), 511-528.
6. Clark, A.R. and Clark, S.J., 2000. Rolling-horizon lot-sizing when set-up times are sequence- dependent. International Journal of Production Research, 38 (10), 2287-2307.
7. Clark, A.R., Neto, R.M., and Toso, E.A.V., 2006. Multi-period production setup-sequencing and lot- sizing through ATSP subtour elimination and patching. In: Proceedings of the 25 th workshop of the UK planning and scheduling special interest group. University of Nottingham, 80-87.
8. Degraeve, Z. and Jans, R., 2007. A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Operations Research, 55 (5), 909-920.
9. Glover, F. and Laguna, M., 1997. Tabu search. Boston: Kluwer Academic Publishers.
10. Gopalakrishnan, M., et al., 2001. A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science, 47 (6), 851-863.
11. Gupta, D. and Magnusson, T., 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers and Operations Research, 32 (4), 727-747.
12. Haase, K., 1994. Lot sizing and scheduling for production planning. Berlin: Lecture Notes in Economics and Mathematical Systems, Springer.
13. Hansen, P. and Mladenovic, N., 2003a. A tutorial on variable neighborhood search. Canada: Les Cahiers du GERAD, HEC Montreal and GERAD, G-2003-46.
14. Hansen, P. and Mladenovic, N., 2003b. Variable neighborhood search, In: F. Glover and G. Kochenberger, eds. Handbook of metaheuristics. Dordrecht: Kluwer, 145-184.
15. Jans, R. and Degraeve, Z., 2004. An industrial extension of the discrete lot-sizing and scheduling problem. IIE Transactions, 36 (1), 47-58.
16. Jans, R. and Degraeve, Z., 2007. Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research, 177 (3), 1855-1875.
17. Jans, R. and Degraeve, Z., 2008. Modeling industrial lot sizing problems: a review. International Journal of Production Research, 46 (6), 1619-1643.
18. Karimi, B., Ghomi, S.M.T.F., and Wilson, J.M., 2003. The capacitated lot sizing problem: a review of models and algorithms. Omega, 31 (5), 365-378.
19. Karimi, B., Ghomi, S.M.T.F., and Wilson, J.M., 2006. A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over. Journal of the Operational Research Society, 57 (2), 140-147.
20. Maes, J., McClain, J.O., and Vanwassenhove, L.N., 1991. Multilevel capacitated lotsizing complexity and lp-based heuristics. European JournalofOperationalResearch, 53 (2), 131-148.
21. Meyr, H., 2000. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research, 120 (2), 311-326.
22. Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139 (2), 277-292.
23. Ozdamar, L., Birbil, S.I., and Portmann, M.C., 2002. Technical note: New results for the capacitated lot sizing problem with overtime decisions and setup times. Production Planning and Control, 13 (1), 2-10.
24. Ozdamar, L. and Bozyel, M.A., 2000. The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions, 32 (11), 1043-1057.
25. Pochet, Y. and Wolsey, L.A., 2006. Production planning by mixed integer programming, In: Springer Series in Operations Research and Financial Engineering. New York: Springer.
26. Suerie, C., 2006. Modeling of period overlapping setup times. European Journal of Operational Research, 174 (2), 874-886.
27. Suerie, C. and Stadtler, H., 2003. The capacitated lot-sizing problem with linked lot sizes. Management Science, 49 (8), 1039-1054.
28. Vanderbeck, F., 1998. Lot-sizing with start-up times. Management Science, 44 (10), 1409-1425.