A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Consider the problem of scheduling a set of jobs to be processed exactly once, on any machine of a set of unrelated parallel machines, without preemption. Each job has a due date, weight, and, for each machine, an associated processing time and sequence-dependent setup time. The objective function considered is to minimize the total weighted tardiness of the jobs. This work proposes a non-delayed relax-and-cut algorithm, based on a Lagrangean relaxation of a time indexed formulation of the problem. A Lagrangean heuristic is also developed to obtain approximate solutions. Using the proposed methods, it is possible to obtain optimal solutions within reasonable time for some instances with up to 180 jobs and six machines. For the solutions for which it is not possible to prove optimality, interesting gaps are obtained.

[1]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[2]  Maurice Queyranne,et al.  Polyhedral Approaches to Machine Scheduling , 2008 .

[3]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[4]  G. Nemhauser,et al.  Integer Programming , 2020 .

[5]  Philippe Chrétienne,et al.  A cutting plane algorithm for the unrelated parallel machine scheduling problem , 2002, Eur. J. Oper. Res..

[6]  M. Guignard.  Lagrangean relaxation , 2003 .

[7]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[8]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[9]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[10]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[11]  Wooseung Jang,et al.  Scheduling unrelated parallel machines to minimize total weighted tardiness , 2006, SOLI 2006.

[12]  Abilio Lucena.  Non Delayed Relax-and-Cut Algorithms , 2005, Ann. Oper. Res..

[13]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[14]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[15]  Michael Pinedo,et al.  Optimization and Heuristics of Scheduling , 2002 .

[16]  José M. Valério de Carvalho,et al.  A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times , 2007, Eur. J. Oper. Res..

[17]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[18]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[19]  Marcelo Seido Nagano,et al.  A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..

[20]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[21]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[22]  Shanlin Yang,et al.  Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms ☆ , 2009 .

[23]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[24]  Shunji Tanaka,et al.  A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .

[25]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[26]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[27]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[28]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[29]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[30]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[31]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[32]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[33]  Kavindra Malik,et al.  A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships , 1994, Ann. Oper. Res..

[34]  M. Guignard.  Efficient cuts in Lagrangean 'Relax-and-cut' schemes , 1998, Eur. J. Oper. Res..

[35]  Ethel Mokotoff,et al.  Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .

[36]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[37]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .