An exact algorithm for the precedence-constrained single-machine scheduling problem

This study proposes an efficient exact algorithm for the precedence-constrained single-machine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is based on the SSDP (Successive Sublimation Dynamic Programming) method and is an extension of the authors’ previous algorithms for the problem without precedence constraints. In this method, a lower bound is computed by solving a Lagrangian relaxation of the original problem via dynamic programming and then it is improved successively by adding constraints to the relaxation until the gap between the lower and upper bounds vanishes. Numerical experiments will show that the algorithm can solve all instances with up to 50 jobs of the precedence-constrained total weighted tardiness and total weighted earliness–tardiness problems, and most instances with 100 jobs of the former problem.

[1]  Gerhard J. Woeginger,et al.  On the approximability of average completion time scheduling under precedence constraints , 2001, Discret. Appl. Math..

[2]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[3]  Roberto Tadei,et al.  An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem , 2004, Oper. Res. Lett..

[4]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[5]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[6]  Leyuan Shi,et al.  On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems , 2007, Math. Program..

[7]  Francis Sourd,et al.  New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling , 2009, INFORMS J. Comput..

[8]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[9]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[10]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[11]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[12]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[13]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[14]  茨木 俊秀,et al.  Enumerative approaches to combinatorial optimization , 1987 .

[15]  Philippe Baptiste,et al.  Constraint-based scheduling , 2001 .

[16]  Shunji Tanaka,et al.  A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time , 2011, Journal of Scheduling.

[17]  Hua Xuan,et al.  Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling , 2007, Comput. Oper. Res..

[18]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[19]  Ola Svensson,et al.  Approximating Precedence-Constrained Single Machine Scheduling by Coloring , 2006, APPROX-RANDOM.

[20]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[21]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[22]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[23]  Steef L. van de Velde.  Dual decomposition of a single-machine scheduling problem , 1995, Math. Program..

[24]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[25]  H. Sherali,et al.  A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems , 1989 .

[26]  Linus Schrage,et al.  Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[27]  Hanif D. Sherali,et al.  Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability , 2007, INFORMS J. Comput..

[28]  Ola Svensson,et al.  Scheduling with Precedence Constraints of Low Fractional Dimension , 2007, IPCO.

[29]  Shunji Tanaka,et al.  An exact algorithm for single-machine scheduling without machine idle time , 2009, J. Sched..

[30]  Shunji Tanaka,et al.  An efficient exact algorithm for general single-machine scheduling with machine idle time , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[31]  Andreas S. Schulz,et al.  Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling , 2011, Math. Oper. Res..

[32]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[33]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[34]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[35]  Monaldo Mastrolilli,et al.  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem , 2009, Algorithmica.

[36]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[37]  Han Hoogeveen,et al.  Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems , 1992, Math. Program..

[38]  Maurice Queyranne,et al.  Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem , 2003, Oper. Res..