A Logic-Based Benders Decomposition for the Car Resequencing Problem with a Painted Body Storage

References

• Al Zoobi A, Coudert D, Nisse N (2023) Finding the k shortest simple paths: Time and space trade-offs. ACM J. Experiment. Algorithmics 28(1):1–23.Crossref, Google Scholar
• Angulo G, Ahmed S, Dey SS (2016) Improving the integer l-shaped method. INFORMS J. Comput. 28(3):483–499.Link, Google Scholar
• Atan Z, Ahmadi T, Stegehuis C, de Kok T, Adan I (2017) Assemble-to-order systems: A review. Eur. J. Oper. Res. 261(3):866–879.Crossref, Google Scholar
• Benders J (1962) Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1):238–252.Crossref, Google Scholar
• Benoist T (2008) Soft car sequencing with colors: Lower bounds and optimality proofs. Eur. J. Oper. Res. 191(3):957–971.Crossref, Google Scholar
• Boysen N, Zenker M (2013) A decomposition approach for the car resequencing problem with selectivity banks. Comput. Oper. Res. 40(1):98–108.Crossref, Google Scholar
• Boysen N, Fliedner M, Scholl A (2009a) Level scheduling of mixed-model assembly lines under storage constraints. Internat. J. Production Res. 47(10):2669–2684.Crossref, Google Scholar
• Boysen N, Fliedner M, Scholl A (2009b) Sequencing mixed-model assembly lines: Survey, classification and model critique. Eur. J. Oper. Res. 192(2):349–373.Crossref, Google Scholar
• Boysen N, Scholl A, Wopperer N (2012) Resequencing of mixed-model assembly lines: Survey and research agenda. Eur. J. Oper. Res. 216(3):594–604.Crossref, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Côté JF, Dell’Amico M, Iori M (2014) Combinatorial Benders’ cuts for the strip packing problem. Oper. Res. 62(3):643–661.Link, Google Scholar
• Elçi Ö, Hooker J (2022) Stochastic planning and scheduling with logic-based Benders decomposition. INFORMS J. Comput. 34(5):2428–2442.Link, Google Scholar
• Epping T, Hochstättler W, Oertel P (2004) Complexity results on a paint shop problem. Discrete Appl. Math. 136(2–3):217–226.Crossref, Google Scholar
• Golle U, Rothlauf F, Boysen N (2014) Car sequencing versus mixed-model sequencing: A computational study. Eur. J. Oper. Res. 237(1):50–61.Crossref, Google Scholar
• Golle U, Rothlauf F, Boysen N (2015) Iterative beam search for car sequencing. Ann. Oper. Res. 226:239–254.Crossref, Google Scholar
• Guo X, Côté JC, Zhang C, Miao L (2025) A logic-based Benders decomposition for the car resequencing problem with a painted body storage. https://doi.org/10.1287/ijoc.2024.0904.cd, https://github.com/INFORMSJoC/2024.0904.Google Scholar
• Hong S, Han J, Choi JY, Lee K (2018) Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops. Appl. Math. Modelling 64:285–297.Crossref, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Jahren E, Achá RA (2018) A column generation approach and new bounds for the car sequencing problem. Ann. Oper. Res. 264:193–211.Crossref, Google Scholar
• Ko SS, Han YH, Choi JY (2016) Paint batching problem on M-to-1 conveyor systems. Comput. Oper. Res. 74:118–126.Crossref, Google Scholar
• Martínez KP, Adulyasak Y, Jans R (2022) Logic-based Benders decomposition for integrated process configuration and production planning problems. INFORMS J. Comput. 34(4):2177–2191.Link, Google Scholar
• Miltenburg J (1989) Level schedules for mixed-model assembly lines in just-in-time production systems. Management Sci. 35(2):192–207.Link, Google Scholar
• Riise A, Mannino C, Lamorgese L (2016) Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling. Eur. J. Oper. Res. 255(3):719–728.Crossref, Google Scholar
• Solnon C, Nguyen A, Artigues C (2008) The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problem. Eur. J. Oper. Res. 191(3):912–927.Crossref, Google Scholar
• Sun Y, Esler S, Thiruvady D, Ernst AT, Li X, Morgan K (2022) Instance space analysis for the car sequencing problem. Ann. Oper. Res. 341:41–69.Crossref, Google Scholar
• Taube F, Minner S (2018) Resequencing mixed-model assembly lines with restoration to customer orders. Omega 78:99–111.Crossref, Google Scholar
• Wu J, Ding Y, Shi L (2021) Mathematical modeling and heuristic approaches for a multi-stage car sequencing problem. Comput. Indust. Engrg. 152:107008.Crossref, Google Scholar