Single-machine scheduling with early and tardy completion costs

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc.

[1]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[2]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[3]  Bruce Faaland,et al.  Scheduling Tasks with Due Dates in a Fabrication/Assembly Process , 1987, Oper. Res..

[4]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[5]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[6]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

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

[9]  M. Raghavachari,et al.  Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[10]  John J. Kankt,et al.  Manufacturing systems with forbidden early order departure , 1984 .

[11]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[12]  L. Schrage.  Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[13]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[14]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

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

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

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

[18]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

[19]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[20]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .

[21]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .