A note on a single machine scheduling problem with generalized total tardiness objective function

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number of tardy jobs on a single machine. The latter algorithm improves the complexity of an existing pseudo-polynomial algorithm by Lawler. Computational results are presented for both special cases considered.

[1]  Alexander A. Lazarev,et al.  Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem , 2009, Math. Comput. Model..

[2]  E R Gafarov,et al.  A Polynomial Time Graphical Algorithm for Maximizing Total Tardiness on a Single Machine , 2010 .

[3]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[4]  Alexander A. Lazarev,et al.  A special case of the single-machine total tardiness problem is NP-hard , 2006 .

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

[6]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

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

[8]  Der‐Chiang Li,et al.  An algorithm for sequencing jobs to minimize total tardiness , 1988 .

[9]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[10]  Alexander A. Lazarev,et al.  SPECIAL CASE OF THE SINGLE MACHINE TOTAL TARDINESS PROBLEM IS NP-HARD , 2006 .

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

[12]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

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

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

[15]  Alexander A. Lazarev,et al.  A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems , 2009, Comput. Math. Appl..