Dynamic programming approach to the single-machine sequencing problem with different due-dates

Abstract Given a set of n jobs each of which is assigned a due-date and all jobs are simultaneously available to be processed on a single machine, the problem is to find the optimal job processing order that minimizes the sum of absolute deviation of job completion times about their respective due-dates. Since this problem has been shown to be NP-complete, we present a DP (dynamic programming) formulation of the problem and apply the principle of optimality of DP to find the optimal solution by implicit enumeration.

[1]  Hamilton Emmons,et al.  Scheduling to a common due date on parallel uniform processors , 1987 .

[2]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

[3]  Mesbah U. Ahmed,et al.  Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[4]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[5]  W. D. Ray.  Dynamic Programming with Management Applications , 1974 .

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

[7]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[8]  T.C.E. Cheng.  Minimizing the average deviation of job completion times about a common due-date: An extension , 1987 .

[9]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[10]  M. Quaddus.  A Generalized Model of Optimal Due-Date Assignment by Linear Programming , 1987 .

[11]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

[12]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[13]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[14]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

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

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