An improved heuristic for the single-machine, weighted-tardiness problem

Omega

Volumn 27, Issue 4, 1999, Pages 485-495

  Holsenback, J E ^a   Russell, R M ^b   Markland, R E ^c   Philipoom, P R ^c  

^a SAVANNAH STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALGARY   (Canada)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Heuristic; Scheduling; Single machine; Weighted tardiness

Indexed keywords

JOB SHOP SCHEDULING;

DUE DATES; FAST SOLVING; HEURISTIC; OPTIMAL SCHEDULE; SCHEDULING; SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM; SINGLE- MACHINES; TOTAL-WEIGHTED TARDINESS; WEIGHTED TARDINESS;

SCHEDULING ALGORITHMS;

EID: 0041992460     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(98)00072-3     Document Type: Article

References (18)

1. Baker K.R., Schrage L. Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks. Oper. Res. 26:1978;111-120.
2. Blackburn J.D., Millen R.A. Heuristic lot sizing performance in a rolling schedule environment. Decision Sci. 11(4):1980;691-701.
3. Chambers R.J., Carraway R.L., Lowe T.J., Morin T.L. Dominance and decomposition heuristics for single machine scheduling. Oper. Res. 39:1991;639-647.
4. Elmaghraby S.E. The one-machine sequencing problem with delay costs. J. Indust. Eng. XIX:1968;105-108.
5. Gruenther WC. Analysis of variance. Englewood Cliffs, NJ: Prentice-Hall, 1968.
6. Hays WL. Statistics. New York, NY: Holt, Rinehart and Winston, 1988.
7. Lawler E.L. A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1:1977;331-342.
8. McNaughton R. Scheduling with deadlines and loss functions. Management Sci 1959;6(1):1-12.
9. Morton TE, Rachamudugu RMU. Myopic heuristics for the single machine weighted tardiness problem. Working Paper 30-82-83. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1982.
10. Neter J, Wasserman W, Kutner MH. Applied linear statistical models. Homewood, IL: Irwin, 1985.
11. Potts C.N., Vanwassenhove L. A decomposition algorithm for the single machine, total tardiness problem. Oper. Res. Lett. 1:1982;177-181.
12. Potts C.N., Vanwassenhove L. A branch-bound algorithm for the single machine, total weighted tardiness problem. Oper. Res. 33:1985;363-377.
13. Rinnooy Kan A.H.G., Lageweg B.J., Lenstra J.K. Minimizing total costs in one-machine scheduling. Oper. Res. 23:1975;908-927.
14. Russell RM, Holsenback JE. A comparative evaluation of a tardiness minimizing heuristic in a general job shop: an extended abstract. In: Sumichrast RT, coordinator. National DSI Conference Proceedings, San Francisco, CA. 1993.
15. Schild A., Fredman I.J. On scheduling tasks with associated linear loss functions. Manage. Sci. 7:1961;280-285.
16. Schrage L., Baker K.R. Dynamic programming solutions of sequencing problems with precedence constraints. Oper. Res. 26:1978;444-449.
17. Shwimer J. On the N-job, one-machine, sequence-independent scheduling problem with tardiness penalties. Manage. Sci. 18:1972;B301-B313.
18. Wilkerson L.J., Irwin J.D. An improved method for scheduling tasks. AIIE Trans. 3:1971;239-245.