On the Single-machine Scheduling Problem with Tardiness Penalties

The n-job, single-machine total tardiness problem is considered in this paper. A branching algorithm based on three theorems is proposed to generate a reduced set of candidate sequences. The computational results indicate that the proposed algorithm provides a smaller set of candidate sequences than the DP algorithm of Schrage and Baker.

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

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

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

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

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

[6]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[7]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[8]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[9]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

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

[11]  Parviz Ghandforoush,et al.  An Algorithm for the Single-Machine Sequencing Problem to Minimize Total Tardiness , 1983 .

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

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