A dynamic programming algorithm for single machine scheduling with ready times

We propose a dynamic programming algorithm for the single machine scheduling problem with ready times and deadlines to minimize total weighted completion time. Weights may be positive or negative and the cost function may be non-regular. This problem appears as a subproblem in the Dantzig-Wolfe decomposition of the job-shop scheduling problem. We show that the algorithm is polynomial if time window length is bounded by a constant and times are integer-valued. We present computational results for problems with up to 200 jobs.

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

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

[3]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[4]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..

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

[6]  Uttarayan Bagchi,et al.  Technical Note - An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines , 1987, Oper. Res..

[7]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[8]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[9]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

[10]  S. Bansal.  Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach , 1980 .

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

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

[13]  Marc E. Posner,et al.  Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..

[14]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

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

[16]  T. Cheng,et al.  Dynamic programming approach to the single-machine sequencing problem with different due-dates , 1990 .

[17]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[18]  Edward P. C. Kao,et al.  On Dynamic Programming Methods for Assembly Line Balancing , 1982, Oper. Res..

[19]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[20]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..