Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition

References

• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Akpinar S, Baykasoglu A (2014a) Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model. J. Manufacturing Systems 33(1):177–187.Crossref, Google Scholar
• Akpinar S, Baykasoglu A (2014b) Modeling and solving mixed-model assembly line balancing problem with setups. Part II: A multiple colony hybrid bees algorithm. J. Manufacturing Systems 33(4):445–461.Crossref, Google Scholar
• Akpinar S, Elmi A, Bektas T (2017) Combinatorial benders cuts for assembly line balancing problems with setups. Eur. J. Oper. Res. 259(2):527–537.Crossref, Google Scholar
• Andrés C, Miralles C, Pastor R (2008) Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur. J. Oper. Res. 187(3):1212–1223.Crossref, Google Scholar
• Barzanji R, Naderi B, Begen MA (2020) Decomposition algorithms for the integrated process planning and scheduling problem. Omega 93:102025.Crossref, Google Scholar
• Battaïa O, Dolgui A (2013) A taxonomy of line balancing problems and their solution approaches. Internat. J. Production Econom. 142(2):259–277.Crossref, Google Scholar
• Baybars I (1986) A survey of exact algorithms for the simple assembly line balancing problem. Management Sci. 32(8):909–932.Link, Google Scholar
• Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3):694–715.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238–252.Crossref, Google Scholar
• Bowman EH (1960) Assembly-line balancing by linear programming. Oper. Res. 8(3):385–389.Link, Google Scholar
• Bukchin Y, Raviv T (2018) Constraint programming for solving various assembly line balancing problems. Omega 78:57–68.Crossref, Google Scholar
• Delorme M, Iori M, Martello S (2017) Logic based benders’ decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78:290–298.Crossref, Google Scholar
• Esmaeilbeigi R, Naderi B, Charkhgard P (2015) The type e simple assembly line balancing problem: A mixed integer linear programming formulation. Comput. Oper. Res. 64:168–177.Crossref, Google Scholar
• Esmaeilbeigi R, Naderi B, Charkhgard P (2016) New formulations for the setup assembly line balancing and scheduling problem. OR Spectrum 38:493–518.Crossref, Google Scholar
• Fazel-Zarandi MM, Beck JC (2012) Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem. INFORMS J. Comput. 24(3):387–398.Link, Google Scholar
• Fazel-Zarandi MM, Berman O, Beck JC (2013) Solving a stochastic facility location/fleet management problem with logic-based benders’ decomposition. IIE Trans. 45(8):896–911.Crossref, Google Scholar
• Fontaine P, Minner S (2018) Benders decomposition for the hazmat transport network design problem. Eur. J. Oper. Res. 267(3):996–1002.Crossref, Google Scholar
• Hackman ST, Magazine MJ, Wee TS (1989) Fast, effective algorithms for simple assembly line balancing problems. Oper. Res. 37(6):916–924.Link, Google Scholar
• Heching A, Hooker JN (2016) Scheduling home hospice care with logic-based Benders decomposition. Internat. Conf. AI OR Techniques Constraint Programming Combin. Optim. Problems. Lecture Notes in Computer Science, vol. 9676 (Springer, Banff, Canada), 187–197.Google Scholar
• Hooker JN (1994) Logic-based methods for optimization. Borning A, ed. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874 (Springer, Berlin, Heidelberg), 336–349.Crossref, Google Scholar
• Hooker JN (2007a) Planning and scheduling by logic-based benders decomposition. Oper. Res. 55(3):588–602.Link, Google Scholar
• Hooker JN (2007b) Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55(3):588–602.Google Scholar
• Hooker J (2011) Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, vol. 2 (John Wiley & Sons, New Jersey).Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Keyvanshokooh E, Ryan SM, Kabir E (2016) Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated benders decomposition. Eur. J. Oper. Res. 249(1):76–92.Crossref, Google Scholar
• Mariel K, Minner S (2017) Benders decomposition for a strategic network design problem under NAFTA local content requirements. Omega 68:62–75.Crossref, Google Scholar
• Martino L, Pastor R (2010) Heuristic procedures for solving the general assembly line balancing problem with setups. Internat. J. Production Res. 48(6):1787–1804.Crossref, Google Scholar
• Marufuzzaman M, Gedik R, Roni MS (2016) A Benders based rolling horizon algorithm for a dynamic facility location problem. Comput. Indust. Engrg. 98:462–469.Crossref, Google Scholar
• Michels AS, Lopes TC, Sikora CGS, Magatão L (2019) A Benders’ decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem. Eur. J. Oper. Res. 278(3):796–808.Crossref, Google Scholar
• Naderi B, Roshanaei V (2020) Branch-relax-and-check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. Eur. J. Oper. Res. 286(3):811–827.Google Scholar
• Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4):754–768.Crossref, Google Scholar
• Naderi B, Azab A, Borooshan K (2019) A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace. Internat. J. Production Res. 57(3):643–661.Crossref, Google Scholar
• Özcan U (2019) Balancing and scheduling tasks in parallel assembly lines with sequence-dependent setup times. Internat. J. Production Econom. 213:81–96.Crossref, Google Scholar
• Pastor R, Ferrer L (2009) An improved mathematical program to solve the simple assembly line balancing problem. Internat. J. Production Res. 47(11):2943–2959.Crossref, Google Scholar
• Patterson JH, Albracht JJ (1975) Technical note—Assembly-line balancing: Zero-one programming with Fibonacci search. Oper. Res. 23(1):166–172.Link, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, 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
• Roshanaei V, Azab A, ElMaraghy H (2013) Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Internat. J. Production Res. 51(20):6247–6274.Crossref, Google Scholar
• Roshanaei V, Luong C, Aleman DM, Urbach D (2017a) Collaborative operating room planning and scheduling. INFORMS J. Comput. 29(3):558–580.Link, Google Scholar
• Roshanaei V, Luong C, Aleman DM, Urbach D (2017b) Propagating logic-based Benders decomposition approaches for distributed operating room scheduling. Eur. J. Oper. Res. 257(2):439–455.Crossref, Google Scholar
• Roshanaei V, Luong C, Aleman DM, Urbach D (2020) Reformulation, linearization, and decomposition techniques for balanced distributed operating room scheduling. Omega 93:102043.Crossref, Google Scholar
• Şahin M, Kellegöz T (2017) Increasing production rate in U-type assembly lines with sequence-dependent set-up times. Engrg. Optim. 49(8):1401–1419.Crossref, Google Scholar
• Scholl A, Boysen N, Fliedner M (2013) The assembly line balancing and scheduling problem with sequence-dependent setup times: Problem extension, model formulation and efficient heuristics. OR Spectrum 35(1):291–320.Crossref, Google Scholar
• Sefair JA, Mendez CY, Babat O, Medaglia AL, Zuluaga LF (2017) Linear solution schemes for mean-semivariance project portfolio selection problems: An application in the oil and gas industry. Omega 68:39–48.Crossref, Google Scholar
• Seyed-Alagheband SA, Ghomi SMTF, Zandieh M (2011) A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Internat. J. Production Res. 49(3):805–825.Crossref, Google Scholar
• Sivasankaran P, Shahabudeen P (2014) Literature review of assembly line balancing problems. Internat. J. Advanced Manufacturing Tech. 73:1665–1694.Crossref, Google Scholar
• Tang Q, Liang Y, Zhang L, Floudas CA, Cao X (2016) Balancing mixed-model assembly lines with sequence-dependent tasks via hybrid genetic algorithm. J. Global Optim. 65:83–107.Crossref, Google Scholar
• Terekhov D, Beck JC, Brown KN (2009) A constraint programming approach for solving a queueing design and control problem. INFORMS J. Comput. 21(4):549–561.Link, Google Scholar
• Wee T, Magazine M (1982) Assembly line balancing as generalized bin packing. Oper. Res. Lett. 1(2):56–58.Crossref, Google Scholar
• Wheatley D, Gzara F, Jewkes E (2015) Logic-based benders decomposition for an inventory-location problem with service constraints. Omega 55:10–23.Crossref, Google Scholar
• White WW (1961) Letter to the editor—Comments on a paper by Bowman. Oper. Res. 9(2):274–276.Link, Google Scholar
• Yang W, Cheng W (2020) Modelling and solving mixed-model two-sided assembly line balancing problem with sequence-dependent setup time. Internat. J. Production Res. 58(21):6638–6659.Crossref, Google Scholar
• Yolmeh A, Kianfar F (2012) An efficient hybrid genetic algorithm to solve assembly line balancing problem with sequence-dependent setup times. Comput. Indust. Engrg. 62(4):936–945.Crossref, Google Scholar
• Zarrinpoor N, Fallahnezhad MS, Pishvaee MS (2018) The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm. Eur. J. Oper. Res. 265(3):1013–1032.Crossref, Google Scholar