Decomposition Methods for the Parallel Machine Scheduling Problem with Setups

References

• Achterberg T (2009) SCIP: Solving constraint integer programs. Math. Programming Comput. 1(1):1–41.Crossref, Google Scholar
• Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219–239.Crossref, Google Scholar
• Al-Salem A (2004) Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times. Engrg. J. Univ. Qatar 17(1):177–187.Google Scholar
• Aramon Bajestani M, Beck JC (2013) Scheduling a dynamic aircraft repair shop with limited repair resources. J. Artificial Intelligence Res. 47:35–70.Crossref, Google Scholar
• Arcus AL (1965) A computer method of sequencing operations for assembly lines. Internat. J. Production Res. 4(4):259–277.Crossref, Google Scholar
• Arnaout JP, Rabadi G, Musa R (2010) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intelligent Manufacturing 21(6):693–701.Crossref, Google Scholar
• Avalos-Rosales O, Alvarez A, Angel-Bello F (2013) A reformulation for the problem of scheduling unrelated parallel machines with sequence and machine dependent setup times. Proc. Twenty-Third Internat. Conf. Automated Planning Scheduling (ICAPS2013), Rome, 278–282.Crossref, Google Scholar
• Baker KR (1974) Introduction to Sequencing and Scheduling (John Wiley & Sons, New York).Google Scholar
• Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York), 3–27.Crossref, Google Scholar
• Beck JC (2010) Checking-up on branch-and-check. Cohen D, ed. Proc. Sixteenth Internat. Conf. Principles Practice Constraint Programming (CP2010) (Springer, Berlin), 84–98.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1): 238–252.Crossref, Google Scholar
• Benini L, Bertozzi D, Guerri A, Milano M (2005) Allocation and scheduling for MPSOCS via decomposition and no-good generation. van Beek P, ed. Proc. Eleventh Internat. Conf. Principles Practice Constraint Programming (CP2005) (Springer, Berlin), 107–121.Crossref, Google Scholar
• Chu Y, Xia Q (2005) A hybrid algorithm for a class of resource constrained scheduling problems. Barták R, Milano M, eds. Proc. 2nd Conf. Integration AI OR Techniques Constraint Programming Combinatorial Optim. Problems (Springer, Berlin), 110–124.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):399–415.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
• Focacci F, Laborie P, Nuijten W (2000) Solving scheduling problems with setup times and alternative resources. Proc. 5th Internat. Conf. Artificial Intelligence Planning Scheduling, Breckenridge, CO, 92–101.Google Scholar
• França PM, Gendreau M, Laporte G, Muller FM (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Internat. J. Production Econom. 43(2–3):79–89.Crossref, Google Scholar
• Glass CA, Potts CN, Shade P (1994) Unrelated parallel machine scheduling using local search. Math. Comput. Modelling 20(2): 41–52.Crossref, Google Scholar
• Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5(2):287–326.Crossref, Google Scholar
• Guinet A (1991) Textile production systems: A succession of non-identical parallel processor shops. J. Oper. Res. Soc. 42(8): 655–671.Crossref, Google Scholar
• Helal M, Rabadi G, Al-Salem A (2006) A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. Internat. J. Oper. Res. 3(3):182–192.Google Scholar
• Hooker JN (1995) Verifying logic circuits by Benders decomposition. Saraswat V, Van Hentenryck P, eds. Principles and Practice of Constraint Programming: The Newport Papers (MIT Press, Cambridge, MA), 267–288.Google Scholar
• Hooker JN (2000) Logic-Based Methods for Optimization (Wiley, New York).Crossref, Google Scholar
• Hooker JN (2005) A hybrid method for the planning and scheduling. Constraints 10(4):385–401.Crossref, 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.Crossref, Google Scholar
• Karp RM (1972) Reducibility Among Combinatorial Problems (Springer-Verlag, Berlin).Crossref, Google Scholar
• Lancia G (2000) Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. Eur. J. Oper. Res. 120(2):277–288.Crossref, Google Scholar
• Lee J-H, Yu J-M, Lee D-H (2013) A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: Minimizing total tardiness. Internat. J. Advanced Manufacturing Tech. 69(9):1081–1089.Google Scholar
• Lombardi M, Milano M (2012) Optimal methods for resource allocation and scheduling: A cross-disciplinary survey. Constraints 17(1):51–85.Crossref, Google Scholar
• Rabadi G (2008) Scheduling research virtual center. Accessed March 2012, http://schedulingresearch.com/.Google Scholar
• Rabadi G, Moraga RJ, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J. Intelligent Manufacturing 17(1):85–97.Crossref, Google Scholar
• Rocha PL, Ravetti MG, Mateus GR, Pardalos PM (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput. Oper. Res. 35(4):1250–1264.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
• Thorsteinsson E (2001) Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. Proc. Seventh Internat. Conf. Principles Practice Constraint Programming (CP2001) (Springer-Verlag, Berlin), 16–30.Crossref, Google Scholar
• Tran TT, Beck JC (2012) Logic-based Benders decomposition for alternative resource scheduling with sequence-dependent setups. Proc. Twentieth Eur. Conf. Artificial Intelligence (ECAI2012) Montpellier, France, 774–779.Google Scholar
• Valle CA, Martinez LC, Da Cunha AS, Mateus GR (2011) Heuristic and exact algorithms for a min–max selective vehicle routing problem. Comput. Oper. Res. 38(7):1054–1065.Crossref, Google Scholar