论文信息 - Heuristics for the common due date weighted tardiness problem

Heuristics for the common due date weighted tardiness problem

In this paper we consider the single machine “common due date weighted tardiness problem.” Initially the problem is related to other versions of the single machine total weighted tardiness problem. Several heuristics for the problem are discussed. Three “simple” heuristics are proposed and shown to have arbitrarily bad worst case performance. A fourth heuristic is then proposed and shown to have a worst case performance bound of 2.

Y. Fathi | H. Nuttle

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

[2] Albert Schild,et al. On Scheduling Tasks with Associated Linear Loss Functions , 1961 .

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

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

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

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

[7] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8] Thomas E. Morton,et al. Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[9] E. L. Lawler,et al. A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

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

[11] Ram Mohan V. Rachamadugu,et al. Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..