A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

Abstract We consider the problem of scheduling n independent jobs on m unrelated parallel machines with sequence-dependent setup times and availability dates for the machines and release dates for the jobs to minimize a regular additive cost function. In this work, we develop a new branch-and-price optimization algorithm for the solution of this general class of parallel machines scheduling problems. A new column generation accelerating method, termed “ primal box ”, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed. The computational results show that the approach solves problems of large size to optimality within reasonable computational time.

[1]  Zhi-Long Chen,et al.  Parallel machine scheduling with a common due window , 2002, Eur. J. Oper. Res..

[2]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[3]  José M. Valério de Carvalho,et al.  Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..

[4]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[5]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[6]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[7]  Manuel Joaquim Pereira Lopes,et al.  Resolução de Problemas de Programação de Máquinas Paralelas pelo Método de Partição e Geração de Colunas , 2004 .

[8]  Jacques Desrosiers,et al.  A proximal trust-region algorithm for column generation stabilization , 2003, Comput. Oper. Res..

[9]  Johnny C. Ho,et al.  Minimizing the number of tardy jobs for m parallel machines , 1995 .

[10]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[11]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[12]  Warren B. Powell,et al.  Exact algorithms for scheduling multiple families of jobs on parallel machines , 2003 .

[13]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[14]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[15]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[16]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[17]  Warren B. Powell,et al.  Solving Parallel Machine Scheduling Problems by Column Generation , 1999, INFORMS J. Comput..

[18]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[20]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[21]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[22]  Han Hoogeveen,et al.  Parallel Machine Scheduling by Column Generation , 1999, Oper. Res..