CON due-date determination and sequencing

Abstract We consider a CON due-date problem where the objective is to determine an optimal sequence S ∗ and the associated optimal due-date d ∗ which will minimize the total weighted earliness and tardiness of jobs. Except in some special cases, moderate to large instances of the problem cannot be solved in reasonable time with the existing methodology. This paper presents solution strategies that are more effective. A 0–1 quadratic programming formulation, branch and bound schemes based on recursion, and dynamic programming algorithms are used for finding exact solutions to the problem. A simple heuristic based on the 0–1 programming approach is also proposed. Results of a computational study are reported to show the relative effectiveness of the different methods.

[1]  C. R. Bector,et al.  Determination of an optimal common due date and optimal sequence in a single machine job shop , 1988 .

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

[3]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[4]  T. C. Edwin Cheng,et al.  An algorithm for the con due-date determination and sequencing problem , 1987, Comput. Oper. Res..

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

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

[7]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[8]  Michael W. Carter,et al.  The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..

[9]  T. C. Edwin Cheng,et al.  Optimal common due-date with limited completion time deviation , 1988, Comput. Oper. Res..

[10]  A. K. Mittal,et al.  Unconstrained quadratic bivalent programming problem , 1984 .

[11]  S. S. Panwalkar,et al.  Optimal assignment of due-dates for a single processor scheduling problem , 1981 .

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

[13]  Gary D. Scudder,et al.  On the Assignment of Optimal Due Dates , 1989 .

[14]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[15]  R. McBride,et al.  An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .

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