A branch-and-bound algorithm to minimize total tardiness with different release dates

This article deals with the scheduling problem for minimizing total tardiness with unequal release dates. A set of jobs have to be scheduled on a machine able to perform only one job at a time. No preemptive job is allowed. This problem has been proven to be NP-hard. We prove some dominance properties, and provide a lower bound polynomially computed for this problem. On the basis of our previous results, we propose a branch-and-bound algorithm to solve the problem. This algorithm was tested on hard problems involving 30 jobs and also on relatively easy problems with up to 230 jobs. Detailed computational results are given.

[1]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[2]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[3]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

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

[5]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[6]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[7]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[8]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

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

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

[11]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[12]  E. L. Lawler,et al.  A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

[13]  Jwm Will Bertrand,et al.  A dynamic priority rule for scheduling against due-dates , 1982 .

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

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

[16]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

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

[18]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[19]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[20]  Chengbin Chu,et al.  Minimisation de la somme des retards pour les problèmes d'ordonnancement à une machine , 1989 .

[21]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[22]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..