Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions

European Journal of Operational Research

Volumn 214, Issue 3, 2011, Pages 595-605

  Lang, Jan Christian ^a   Shen, Zuo Jun Max ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Capacitated lot sizing and scheduling; Heuristics; Integer programming; Production; Sequence dependent setups; Substitutions

Indexed keywords

AUTOMOBILE MANUFACTURE; BUDGET CONTROL; COSTS; OPTIMIZATION; PLASTIC SHEETS; PRODUCTION; PRODUCTION CONTROL; SUBSTITUTION REACTIONS;

CAPACITATED LOT SIZING; COMPUTATIONAL EXPERIMENT; HEURISTICS; MIXED INTEGER PROGRAMMING (MIP); PRODUCT SUBSTITUTIONS; PRODUCTION PLANNING; SEQUENCE DEPENDENT SETUPS; STATE-OF-THE-ART APPROACH;

INTEGER PROGRAMMING;

EID: 84861189507     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.05.014     Document Type: Article

References (26)

1. Absi, N., Kedad-Sidhoum, S., 2007. MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO - Operations Research - Recherche Opérationnelle 41, 171-192. (Pubitemid 47154329)
2. Akartunali, K., Miller, A., 2009. A heuristic approach for big bucket multi-level production planning problems. European Journal of Operational Research 193 (2), 396-411.
3. Almada-Lobo, B., Klabjan, D., Carravilla, M., Oliveira, J., 2007. Single machine multiproduct capacitated lot sizing with sequence-dependent setups. International Journal of Production Research 45 (20), 4873-4894. (Pubitemid 47352796)
4. Balakrishnan, A., Geunes, J., 2000. Requirements planning with substitutions: Exploiting bill-of-materials flexibility in production planning. Manufacturing and Service Operations Management 2 (2), 166-185.
5. Begnaud, J., Miller, L., Benjaafar, S., 2006. The multilevel lot sizing problem with flexible production sequences. Tech. rep., Industrial and Systems Engineering Department of Mechanical Engineering, University of Minnesota, MN.
6. Beraldi, P., Ghiani, G., Grieco, A., Guerriero, E., 2008. Rolling-horizon and fix-andrelax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Computers and Operations Research 35 (11), 3644-3656. (Pubitemid 351443068)
7. de Araujo, S., Arenales, M., Clark, A., 2007. Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics 13 (4), 337-358. (Pubitemid 47117880)
8. Dickersbach, J.T., 2006. Supply chain management with APO: Structures, modelling approaches, and implementation of MySAP SCM 4.1, second ed. Springer, Berlin Heidelberg New York.
9. Federgruen, A., Meissner, J., Tzur, M., 2007. Progressive interval heuristics for multiitem capacitated lot sizing problems. Operations Research 55 (3), 490-502. (Pubitemid 351159505)
10. Fleischmann, B., Meyr, H., 1997. The general lotsizing and scheduling problem. OR Spectrum 19 (1), 11-21.
11. Gupta, D., 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. Gutin, G., Punnen, A., 2002. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Boston Dordrecht London.
13. Haase, K., 1996. Capacitated lot-sizing with sequence dependent setup costs. OR Spectrum 18 (1), 51-59.
14. Haase, K., Kimms, A., 2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics 66 (2), 159-169.
15. Helber, S., Sahling, F., 2010. A fix-and-optimize approach for the multi-level capacitated lot sizing problem. International Journal of Production Economics 123 (2), 247-256.
16. Helsgaun, K., 2000. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126 (1), 106-130.
17. Hsu, V.N., Li, C.L., Xiao, W.Q., 2005. Dynamic lot size problems with one-way product substitution. IIE Transactions 37, 201-215. (Pubitemid 40274546)
18. Lang, J.C., 2010. Production and Inventory Management with Substitutions. Lecture Notes in Economics and Mathematical Systems, 636. Springer, Berlin, Heidelberg, New York.
19. Lang, J.C., Domschke, W., 2010. Efficient reformulations for dynamic lot-sizing problems with product substitution. OR Spectrum 32 (2), 263-291.
20. Puchinger, J., Raidl, G., 2005. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In: Mira, J., Alvarez, J.R. (Eds.), Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, Lecture Notes in Computer Science, 3562. Springer, Berlin, Heidelberg, New York, pp. 41-53. (Pubitemid 41425240)
21. Sahling, F., 2010. Mehrstufige Losgrößenplanung bei Kapazitätsrestriktionen. Gabler/Deutscher Universitäts-Verlag, Wiesbaden, Germany.
22. Sahling, F., Buschkühl, L., Tempelmeier, H., Helber, S., 2009. Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix and- optimize heuristic. Computers and Operations Research 36 (9), 2546-2553.
23. SAP, 2011. SAP Advanced Planner and Optimizer (SAP APO) online documentation. Available from: .
24. Stadtler, H., 2003. Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research 51 (3), 487-502.
25. Tempelmeier, H., Derstroff, M., 1996. A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42 (5), 738-757. (Pubitemid 126611826)
26. Zhu, X., Wilhelm, W., 2006. Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions 38 (11), 987-1007. (Pubitemid 44355862)