Single machine scheduling to minimize total weighted tardiness

European Journal of Operational Research

Volumn 165, Issue 2, 2005, Pages 423-443

  Cheng, T C E ^a   Ng, C T ^a   Yuan, J J ^a,b   Liu, Z H ^a,c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b ZHENGZHOU UNIVERSITY   (China)

^c EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Due dates; Processing plus wait; Single machine scheduling; SLK due dates; Tardiness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

DUE DATES; PROCESSING-PLUS-WAIT; SINGLE MACHINE SCHEDULING; SLK DUE-DATES; TARDINESS;

PROJECT MANAGEMENT;

EID: 13444309301     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.04.013     Document Type: Conference Paper

References (23)

1. Abdul-Razaq T.S., Potts C.N., Van Wassenhove L.N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics. 26:1990;235-253
2. Arkin E.M., Roundy R.O. Weighted-tardiness scheduling on parallel machines with proportional weights. Operations Research. 39:1991;64-81
3. Baker K.R. Introduction to Sequencing and Scheduling. 1974;Wiley, New York, NY
4. Cheng T.C.E. Optimal slack due-date determination and sequencing. Engineering Costs and Production Economics. 10:1986;305-309
5. Cheng T.C.E., Gupta M.C. Survey of scheduling research involving due-date determination decisions. European Journal of Operational Research. 38:1989;156-166
6. Cheng T.C.E., Oguz C., Qi X. Due date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics. 43:1996;107-113
7. Cheng T.C.E., Kovalyov M.Y. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. European Journal of Operational Research. 114:1999;403-410
8. Du J.Z., Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research. 15:1990;483-495
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA
10. Hochbaum D.S. Approximation Algorithms for NP-Hard Problems. 1997;PWS, Boston, MA
11. Holsenback J.E., Russell R.M., Markland R.E., Philipoom P.R. An improved heuristic for the single-machine weighted-tardiness problem. Omega, International Journal of Management Science. 27:1999;485-499
12. Kahlbacher H.G., Cheng T.C.E. Processing-plus-wait due dates in single-machine scheduling. Journal of Optimization Theory and Applications. 85:1995;163-186
13. Lawler E.L. Optimal sequencing of a single machine subject to precedence constraints. Management Science. 19:1973;544-546
14. Lawler E.L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics. 1:1977;331-342
15. Lawler E.L., Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Science. 16:1969;77-84
16. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362
17. Oguz C., Dincer C. Single machine earliness-tardiness scheduling problems using the equal-slack rule. Journal of the Operational Research Society. 5:1994;589-594
18. Papadimitriou C.H., Steiglitz K. Combinatorial Optimization. 1982;Prentice Hall, Englewood Cliffs, NJ
19. Potts C., Van Wassenhove L. A branch and bound algorithm for the total weighted tardiness problem. Operations Research. 33:1985;363-377
20. Schrage L., Baker K.R. Dynamic programming solution of sequencing problems with precedence constraints. Operations Research. 26:1978;444-449
21. Smith M.L., Seidmann A. Due-date selection procedures for job-shop simulation. Computers and Industrial Engineering. 7:1983;199-207
22. Volgenant A., Teerhuis E. Improved heuristics for the. n -job single machine weighted tardiness problem Computers and Operations Research. 26:1999;35-44
23. Yuan J.J. The NP-hardness of the single machine common due date weighted tardiness problem. Systems Science and Mathematical Sciences. 5(4):1992;328-333