New precedence theorems for one-machine weighted tardiness

Mathematics of Operations Research

Volumn 32, Issue 3, 2007, Pages 579-588

  Kanet, J J ^a  

^a UNIVERSITY OF DAYTON   (United States)

Author keywords

Precedence; Single machine scheduling; Weighted tardiness

Indexed keywords

PRECEDENCE; SINGLE-MACHINE SCHEDULING; WEIGHTED TARDINESS;

FUNCTIONS; JOB ANALYSIS; OPTIMIZATION; SCHEDULING; THEOREM PROVING;

OPERATIONS RESEARCH;

EID: 38549093172     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0255     Document Type: Article

References (29)

1. Abdul-Razaq, T. S., C. N. Potts, L. N. Van Wassenhove. 1990. A survey of algorithms for single machine total weighted tardiness scheduling problems. Discrete Appl. Math. 26(2-3) 235-253.
2. Akturk, M. S., M. B. Yildirim. 1999. A new dominance rule for the total weighted tardiness problem. Production Planning Control 10(2) 138-149.
3. Arkin, E. M., R. O. Roundy. 1991. Weighted-tardiness scheduling on parallel machines with proportional weights. Oper. Res. 39 64-81.
4. Baker, K. R., J. W. M. Bertrand. 1982. A dynamic priority rule for scheduling against due-dates. J. Oper. Management 3(1) 37-42.
5. Baker, K. R., J. J. Kanet. 1983. Job shop scheduling with modified due dates. J. Oper. Management 4(1) 11-22.
6. Della Croce, F., R. Tadei, P. Baracco, A. Grosso. 1998. A new decomposition approach for the single machine total tardiness scheduling problem. J. Oper. Res. Soc. 49 1101-1106.
7. Emmons, H. 1969. One-machine sequencing to minimize certain functions of job tardiness. Oper. Res. 17 701-715.
8. Fisher, M. 1976. A dual algorithm for the one-machine scheduling problem. Math. Programming 11 229-251.
9. Gelders, L., P. R. Kleindorfer. 1974. Coordinating aggregate and detailed scheduling in the one-machine job shop I: Theory. Oper. Res. 22 46-60.
10. Gelders, L., P. R. Kleindorfer. 1975. Coordinating aggregate and detailed scheduling in the one-machine job shop II: Computation and structure. Oper. Res. 23 312-324.
11. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 4 287-326.
12. j. Working paper, University of Dayton, Dayton, OH.
13. Kanet, J. J., X. Li. 2004. A weighted modified due date rule for sequencing to minimize weighted tardiness. J. Scheduling 7 263-278.
14. Lawler, E. A. 1977. "Pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 331-342.
15. Lawler, E. L. 1979. Efficient implementation of dynamic programming algorithms for sequencing problems. Report BW 106, Mathematisch Centrum, Amsterdam, The Netherlands.
16. Lee, Y H., K. Bhaskaran, M. Pinedo. 1997. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans. 29 45-52.
17. Mason, S. J., J. W. Fowler, W. M. Carlyle. 2002. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. J. Scheduling 5(3) 247-262.
18. Potts, C. N., L. N. van Wassenhove. 1982. A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1 177-182.
19. Potts, C. N., L. N. van Wassenhove. 1985. A branch and bound algorithm for the total weighted tardiness problem. Oper. Res. 33 363-377.
20. Rachamadugu, R. M. V 1987. A note on the weighted tardiness problem. Oper. Res. 35 450-451.
21. Rinnooy Kan, A. H. G., B. J. Lageweg, J. K. Lenstra. 1975. Minimizing total costs in one-machine scheduling. Oper. Res. 23 908-927.
22. Schrage, L. E., K. R. Baker. 1978. Dynamic programming solution of sequencing problems with precedence constraints. Oper. Res. 26 444-449.
23. Sen, T., J. M. Sulek, P. Dileepan. 2003. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey. Internat J. Production Econom. 83 1-12.
24. Srinivasan, V 1971. A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness. NRLQ 18 317-327.
25. Szwarc, W., J. J. Liu. 1993. Weighted tardiness single machine scheduling with proportional weights. Management Sci. 39 626-632.
26. Szwarc, W., F. Della Croce, A. Grosso. 1999. Solution of the single machine total tardiness problem. J. Scheduling 2 55-71.
27. Szwarc, W., A. Grosso, F. Della Croce. 2001. Algorithmic paradoxes of the single-machine total tardiness problem. J. Scheduling 4 93-104.
28. Tansel, B. C., B. Y Kara, I. Sabuncuoflu. 2001. An efficient algorithm for the single machine total tardiness problem. HE Trans. 33 661-674.
29. Vepsalainen, A. P., T. E. Morton. 1987. Priority rules for job shops with weighted tardiness costs. Management Sci. 33 1035-1047.