论文信息 - On the single machine total tardiness problem

On the single machine total tardiness problem

In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.

T. C. Edwin Cheng | C. T. Ng | Zhongjun Tian

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

[2] Wlodzimierz Szwarc,et al. Algorithmic paradoxes of the single‐machine total tardiness problem , 2001 .

[3] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5] Christos Koulamas,et al. The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

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

[7] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .

[8] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[9] Wlodzimierz Szwarc,et al. Solution of the single machine total tardiness problem , 1999 .

[10] Christos Koulamas. Polynomially solvable total tardiness problems: Review and extensions , 1997 .

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