Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem

Journal of Scheduling

Volumn 7, Issue 1, 2004, Pages 85-91

  Della Croce, Federico ^a   Grosso, Andrea ^b   Paschos, Vangelis Th ^c  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Scheduling; Total tardiness

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; SET THEORY; THEOREM PROVING;

APPROXIMATION RATIO; DECOMPOSITION HEURISTICS; TOTAL TARDINESS;

PROBLEM SOLVING;

EID: 3543055799     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOSH.0000013056.09936.fd     Document Type: Conference Paper

References (21)

1. Alidaee, B. and S. Gopalan, "A note on the equivalence of two heuristics to minimize total tardiness," Eur. J. Oper. Res., 96, 514-517 (1997).
2. Baker, K. R. and J. W. M. Bertrand, "A dynamic priority rule for scheduling against due dates," J. Oper. Manage., 3, 37-42 (1982).
3. Carroll, D. C., "Heuristic sequencing of single and multiple components," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1965.
4. Chang, S., Q. Lu, G. Tang, and W. Yu, "On decomposition of the total tardiness problem," Oper. Res. Lett., 17, 221-229 (1995).
5. Cheng, T. C., "A note on the equivalence of the Wilkerson-Irwin and modified due-date rules for the mean tardiness sequencing problem," Comput. Ind. Eng., 22, 63-66 (1992).
6. Della Croce, F., R. Tadei, P. Baracco, and A. Grosso, "A new decomposition approach for the single machine total tardiness scheduling problem," J. Oper. Res. Soc., 49, 1101-1106 (1998).
7. Du, J. and J. Y. T. Leung, "Minimizing total tardiness on one machine is NP-hard," Math. Oper. Res., 15, 483-495 (1990).
8. Emmons, H., "One-machine sequencing to minimize certain functions of job tardiness," Oper. Res., 17, 701-715 (1969).
9. Holsenback, J. E. and R. M. Russell, "A heuristic algorithm for sequencing on one machine to minimize total tardiness," J. Oper. Res. Soc., 43, 53-62 (1992).
10. Koulamas, C. P., "The total tardiness problem: Review and extensions," Oper. Res., 42, 1025-1041 (1994).
11. Lawler, E. L., "A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness," Ann. Discrete Math., 1, 331-342 (1977).
12. Lawler, E. L., "A fully polynomial approximation scheme for the total tardiness problem," Oper. Res. Lett., 1, 207-208 (1982).
13. Morton, T. E., R. M. Rachamadugu, and A. Vepsalainen, "Accurate myopic heuristics for tardiness scheduling," GSIA Working Paper 36-83-84, Carnegie Mellon University, PA, 1984.
14. Panwalkar, S. S., M. L. Smith, and C. P. Koulamas, "A heuristic for the single machine tardiness problem," Eur. J. Oper. Res., 70, 304-310 (1993).
15. Potts, C. N. and L. N. Van Wassenhove, "A decomposition algorithm for the single machine total tardiness problem," Oper. Res. Lett., 5, 177-181 (1982).
16. Potts, C. N. and L. N. Van Wassenhove, "Single machine tardiness sequencing heuristics," IIE Trans., 23, 93-108 (1991).
17. Szwarc, W., "Single machine total tardiness problem revisited," in Y. Ijiri (ed.), Creative and Innovative Approaches to the Science of Management, Quorum Books, Westport, CT, pp. 407-419, 1993.
18. Szwarc, W. and S. Mukhopadhyay, "Decomposition of the single machine total tardiness problem," Oper. Res. Lett., 19, 243-250 (1996).
19. Szwarc, W., A. Grosso, and F. Della Croce, "Algorithmic paradoxes of the single machine total tardiness problem," J. Sched., 4, 93-104 (2001).
20. Wilkerson, L. J. and J. D. Irwin, "An improved algorithm for scheduling independent tasks," AIIE Trans., 3, 239-245 (1971).
21. Yu, W., "The two-machines flow shop problem with delays and the one-machine total tardiness problem," Ph.D. dissertation, Eindhoven University of Technology, The Netherlands, 1996.