论文信息 - A decomposition algorithm for the single machine total tardiness problem

A decomposition algorithm for the single machine total tardiness problem

The problem of sequencing jobs on a single machine to minimize total tardiness is considered. An algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small, is presented and is tested on problems with up to 100 jobs.

Chris N. Potts | Luk N. Van Wassenhove | L. V. Wassenhove | C. Potts

[1] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

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

[3] Linus Schrage,et al. Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[4] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

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

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

[7] Linus Schrage,et al. Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

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