Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling

References

• Alvarez-Valdes R, Fuertes A, Tamarit J, Giménez G, Ramos R (2005) A heuristic to schedule flexible job-shop in a glass factory. Eur. J. Oper. Res. 165(2):525–534.Google Scholar
• Amiri M, Zandieh M, Yazdani M, Bagheri A (2010) A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. Internat. J. Production Res. 48(19):5671–5689.Google Scholar
• Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2):149–156.Link, Google Scholar
• Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Comput. Systems 26(4):533–541.Google Scholar
• Barzanji R, Naderi B, Begen MA (2020) Decomposition algorithms for the integrated process planning and scheduling problem. Omega 93:102025.Google Scholar
• Birgin E, Ferreira J, Ronconi D (2015) List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. Eur. J. Oper. Res. 247(2):421–440.Google Scholar
• Booth KEC, Tran TT, Beck JC (2016) Logic-based decomposition methods for the travelling purchaser problem. Quimper CG, ed. Integration of AI and OR Techniques in Constraint Programming: 13th Internat. Conf. (CPAIOR2016), Theoretical Computer Science and General Issues, vol. 9676 (Springer, Cham, Switzerland), 55–64.Google Scholar
• Bozejko A, Werner F (2018) Flexible job shop scheduling with lot streaming and sublot size optimisation. Internat. J. Production Res. 56(19):6391–6411.Google Scholar
• Bozejko W, Uchroski M, Wodecki M (2010) Parallel hybrid metaheuristics for the flexible job shop problem. Comput. Indust. Engrg. 59(2):323–333.Google Scholar
• Brandimarte P (1993) routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(2):157–183.Google Scholar
• Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Management Sci. 35(2):164–176.Link, Google Scholar
• Chambers JB, Barnes JW (1996) Flexible job shop scheduling by Tabu search. Technical Report Series ORP96-09, Graduate Program in Operations Research and Industrial Engineering (The University of Texas, Austin).Google Scholar
• Chang H, Chen Y, Liu T, Chou J (2015) Solving the flexible job shop scheduling problem with makespan optimization by using a hybrid Taguchi-genetic algorithm. IEEE Access 3:1740–1754.Google Scholar
• Chaudhry IA, Khan AA (2016) A research survey: Review of flexible job shop scheduling techniques. Internat. Trans. Oper. Res. 23(3):551–591.Google Scholar
• CPoptimizer (2017) IBM ILOG CPLEX optimization studio CP optimizer user’s manual, 12th ed. Accessed March 1, 2021, https://www.ibm.com/support/knowledgecenter/SSSA5P_12.7.1/ilog.odms.studio.help/pdf/usrcpoptimizer.pdf.Google Scholar
• Dauzre-Prs S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Oper. Res. 70:281–306.Google Scholar
• Demir Y, Isleyen SK (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3):977–988.Google Scholar
• Fattahi P, Mehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intelligent Manufacturing 18(3):331–342.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
• Gao K, Suganthan P, Chua T, Chong C, Cai T, Pan Q (2015) A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Systems Appl. 42(21):7652–7663.Google Scholar
• Gao K, Suganthan P, Pan Q, Chua T, Cai T, Chong C (2016) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intelligent Manufacturing 27(2):363–374.Google Scholar
• Giovanni LD, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200(2):395–408.Google Scholar
• González M, Vela C, Varela R (2013) An efficient memetic algorithm for the flexible job shop with setup times. Borrajo D, Kambhampati S, eds. Proc. Twenty-third Conf. Internat. Conf. Automated Planning Scheduling (AAAI Press, Palo Alto, CA), 91–99.Google Scholar
• Gonzlez MA, Vela CR, Varela R (2015) Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1):35–45.Google Scholar
• Gu X, Huang M, Liang X (2017) The improved simulated annealing genetic algorithm for flexible job-shop scheduling problem. 2017 6th Internat. Conf. Comput. Sci. Network Tech. (ICCSNT), (IEEE, Piscataway, NJ), 22–27.Google Scholar
• Heching A, Hooker JN, Kimura R (2019) A logic-based benders approach to home healthcare delivery. Transportation Sci. 53(2):510–522.Link, Google Scholar
• Hmida A, Haouari M, Huguet M, Lopez P (2010) Discrepancy search for the flexible job shop scheduling problem. Comput. Oper. Res. 37(12):2192–2201.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.Google Scholar
• Hooker JN (2007) Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55(3):588–602.Link, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Google Scholar
• Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektrum 15(4):205–215.Google Scholar
• Jiang T, Zhang C (2018) Application of grey wolf optimization for solving combinatorial problems: Job shop and flexible job shop scheduling cases. IEEE Access 6:26231–26240.Google Scholar
• Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Systems Man Cybernetics Part C: Appl. Rev. 32(1):1–13.Google Scholar
• Kemmoe-Tchomte S, Lamy D, Tchernev N (2017) An effective multi-start multi-level evolutionary local search for the flexible job-shop problem. Engrg. Appl. Artificial Intelligence 62:80–95.Google Scholar
• Kesen S, Güngör Z (2012) Job scheduling in virtual manufacturing cells with lot-streaming strategy: A new mathematical model formulation and a genetic algorithm approach. J. Oper. Res. Soc. 63:683–695.Google Scholar
• Laborie P, Rogerie J (2008) Reasoning with conditional time-interval. Wilson D, Lane HC, eds. Proc. 21st Internat. FLAIRS Conf. (AAAI, Palo Alto, CA), 555–560.Google Scholar
• Laborie P, Rogerie J, Shaw P, Vilím P (2018) IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM/ILOG. Constraints 23(2):210–250.Google Scholar
• Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Internat. J. Production Econom. 174:93–110.Google Scholar
• Liang X, Huang M, Ning T (2018) Flexible job shop scheduling based on improved hybrid immune algorithm. J. Ambient Intelligence Humanized Comput. 9(1):165–171.Google Scholar
• Manne AS (1960) On the job-shop scheduling problem. Oper. Res. 8(2):219–223.Link, Google Scholar
• Mastrolilli M, Gambardella L (2000) Effective neighbourhood functions for the flexible job shop problem. J. Scheduling 3(1):3–20.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, 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.Google Scholar
• Palacios J, Gonzlez M, Vela C, Gonzlez-Rodrguez I, Puente J (2015) Genetic tabu search for the fuzzy flexible job shop problem. Comput. Oper. Res. 54:74–89.Google Scholar
• Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10):3202–3212.Google Scholar
• Riise A, Mannino C, Lamorgese L (2016) Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling. Eur. J. Oper. Res. 255:719–728.Google Scholar
• Roshanaei V (2012) Mathematical modelling and optimization of flexible job shops scheduling problem. Master thesis, University of Windsor, Windsor, Ontario.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.Google Scholar
• Roshanaei V, Luong C, Aleman DM, Urbach DR (2017a) Collaborative operating room planning and scheduling. INFORMS J. Comput. 29(3):558–580.Link, Google Scholar
• Roshanaei V, Luong CM, Aleman D, Urbach D (2017b) Propagating logic-based benders’ decomposition approaches for distributed operating room scheduling. Eur. J. Oper. Res. 257(2):439–455.Google Scholar
• Shen L, Dauzre-Pérs S, Neufeld JS (2018) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2):503–516.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
• Thomalla CS (2001) Job shop scheduling with alternative process plans. Internat. J. Production Econom. 74(1):125–134.Google Scholar
• Tran TT, Araujo A, Beck JC (2016) Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1):83–95.Link, Google Scholar
• Yuan Y, Xu H, Yang J (2013) A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13(7):3259–3272.Google Scholar
• Zgven C, Yavuz Y, Zbakr L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl. Math. Model. 36(2):846–858.Google Scholar
• Zohali H, Naderi B, Roshanaei V (2021) Solving the type-2 assembly line balancing with setups using logic-based benders decomposition. INFORMS J. Comput., ePub ahead of print March 22, https://doi.org/10.1287/ijoc.2020.1015.Google Scholar