Minimizing Total Costs in One-Machine Scheduling

Suppose we have n jobs that arrive simultaneously to be processed on a continuously available machine that can handle only one job at a time. Each job has a fixed processing time and a cost function that is nondecreasing in its finishing time. We want to find a schedule that minimizes total costs. After reviewing the relevant work on this problem, we present a new algorithm for a general cost function. The algorithm is tested for the well known case of a weighted tardiness criterion.

[1]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[2]  A.H.G. Rinnooy Kan,et al.  The machine scheduling problem , 1973 .

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

[4]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

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

[6]  Jan Karel Lenstra.  Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations , 1973 .

[7]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

[8]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[9]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

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

[11]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[12]  Irwin J. Fredman,et al.  Scheduling Tasks with Deadlines and Non-Linear Loss Functions , 1962 .

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

[14]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..