The single-machine total tardiness scheduling problem: Review and extensions

European Journal of Operational Research

Volumn 202, Issue 1, 2010, Pages 1-7

  Koulamas, Christos ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Scheduling

Indexed keywords

EXACT ALGORITHMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; NP-HARD; SCHEDULING PROBLEM; SINGLE MACHINES; STATE-OF-THE-ART ALGORITHMS; THEORETICAL DEVELOPMENT; TOTAL TARDINESS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 70349743955     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.04.007     Document Type: Article

References (66)

1. Abdul-Razaq T.S., Potts C.N., and VanWassenhove L.N. A survey of algorithms for the single machine total weighted tardiness problem. Discrete Applied Mathematics 26 (1990) 235-253
2. Alidaee B., and Gopalan S. A note on the equivalence of two heuristics to minimize total tardiness. European Journal of Operational Research 96 (1997) 514-517
3. Antony S.R., and Koulamas C. Simulated annealing applied to the total tardiness problem. Control and Cybernetics 25 (1996) 121-130
4. Baker K.R., and Bertrand J.W. A dynamic priority rule for scheduling against due-dates. Journal of Operations Management 4 (1982) 11-22
5. Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C., 1999. An ant colony optimization approach for the single machine total tardiness problem. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), Washington, DC, USA, pp. 1445-1450.
6. Bean J.C. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154-160
7. Ben-Daya M., and Al-Fawzan M. A simulated annealing approach for the one machine mean tardiness problem. European Journal of Operational Research 93 (1996) 61-67
8. Biskup D., and Piewitt W. A note on An efficient algorithm for the single machine tardiness problem. International Journal of Production Economics 66 (2000) 287-292
9. Carroll, D.C., 1965. Heuristic sequencing of single and multiple components. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, MA, USA.
10. Chang S., Matsuo H., and Tang G. Worst-case analysis of local search heuristics for the one-machine total tardiness problem. Naval Research Logistics 37 (1990) 111-121
11. Chang S., Lu Q., Tang G., and Yu W. On decomposition of the total tardiness problem. Operations Research Letters 17 (1995) 221-229
12. Cheng T.C.E. A note on the equivalence of the Wilkerson-Irwin and modified due-date rules for the mean tardiness sequencing problem. Computers and Industrial Engineering 22 (1992) 63-66
13. Cheng T.C.E., Ng C.T., Yuan J.J., and Liu Z.H. Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165 (2005) 423-443
14. Cheng T.C.E., Lazarev A.A., and Gafarov E.R. A hybrid algorithm for the single-machine total tardiness problem. Computers and Operations Research 36 (2009) 308-315
15. Chu C. A branch-and-bound algorithm to minimize total tardiness with different due dates. Naval Research Logistics 39 (1992) 265-283
16. Congram R.K., Potts C.N., and van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14 (2002) 52-67
17. Della Croce F., Tadei R., Baracco P., and Grosso A. A new decomposition approach for the single machine total tardiness scheduling problem. Journal of the Operational Research Society 49 (1998) 1101-1106
18. Della Croce F., Grosso A., and Paschos V. Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Journal of Scheduling 7 (2004) 85-91
19. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
20. Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Operations Research 17 (1969) 701-715
21. Fadlalla A., Evans J.R., and Levy M.S. A greedy heuristic for the mean tardiness sequencing problem. Computers and Operations Research 21 (2004) 329-336
22. Gafarov E.R., and Lazarev A.A. A special case of the single-machine total tardiness problem is NP-hard. Journal of Computer and Systems Sciences International 45 (2006) 450-458
23. Graham R.L., Lawler E.L., Lenstra J.K., and Ronnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
24. Hall N.G. Scheduling problems with generalized due dates. IIE Transactions 18 2 (1986) 220-222
25. Hirakawa Y. A quick optimal algorithm for sequencing on one machine to minimize total tardiness. International Journal of Production Economics 60-61 (1999) 549-555
26. Holsenback J.E., and Russell R.M. A heuristic algorithm for sequencing on one machine to minimize total tardiness. Journal of the Operational Research Society 43 (1992) 53-62
27. Kanet J.J. New precedence theorems for one-machine weighted tardiness. Mathematics of Operations Research 32 (2007) 579-588
28. Kondakci S., Kirca O., and Azizoglu M. An efficient algorithm for the single machine tardiness problem. International Journal of Production Economics 36 (1994) 213-219
29. Koulamas C. The total tardiness problem: Review and extensions. Operations Research 42 (1994) 1025-1041
30. Koulamas C. Polynomially solvable total tardiness problems: Review and extensions. Omega, the International Journal of Management Science 25 (1997) 235-239
31. Koulamas C. A faster fully polynomial approximation scheme for the single-machine total tardiness problem. European Journal of Operational Research 193 (2009) 637-638
32. Koulamas C., and Kyparisis G.J. Single machine scheduling with release times, deadlines and tardiness objectives. European Journal of Operational Research 133 (2001) 447-453
33. Kovalyov M.Y. Improving the complexities of approximation algorithms for optimization problems. Operations Research Letters 17 (1995) 85-87
34. Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
35. Lawler E.L. A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters 1 6 (1982) 207-208
36. Lazarev A.A. Solution of the NP-hard total tardiness minimization problem in scheduling theory. Computational Mathematics and Mathematical Physics 47 (2007) 1039-1049
37. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
38. McNaughton R. Scheduling with deadlines and loss functions. Management Science 6 (1959) 1-12
39. Naidu J.T., Gupta J.N.D., and Alidaee B. Insights into two solution procedures for the single machine tardiness problem. Journal of the Operational Research Society 53 (2002) 800-806
40. Panneerselvam R. Simple heuristic to minimize total tardiness in a single machine scheduling problem. International Journal of Advanced Manufacturing Technology 30 (2006) 722-726
41. Panwalkar S.S., Smith M.L., and Seidman A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30 (1982) 391-399
42. Panwalkar S.S., Smith M.L., and Koulamas C.P. A heuristic for the single machine tardiness problem. European Journal of Operational Research 70 (1993) 304-310
43. Potts C.N., and Van Wassenhove L.N. A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters 1 (1982) 177-181
44. Potts C.N., and Van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions 23 4 (1991) 346-354
45. Qi X., Yu G., and Bard J.F. Single machine scheduling with assignable due dates. Discrete Applied Mathematics 122 (2002) 211-233
46. Rinnooy Kan, A.H.G., 1976. Machine scheduling problems: classification, complexity and computation. Nijhoff, The Hague, The Netherlands.
47. Russell R.M., and Holsenback J.E. Evaluation of leading heuristics for the single machine tardiness problem. European Journal of Operational Research 96 (1997) 538-545
48. Russell R.M., and Holsenback J.E. Evaluation of greedy, myopic and less myopic heuristics for the single machine total tardiness problem. Journal of the Operational Research Society 48 (1997) 640-646
49. Sabuncuoglu I., and Gurgun B. A neural model for scheduling problems. European Journal of Operational Research 93 (1996) 288-299
50. Sen T., Sulek J.M., and Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey. International Journal of Production Economics 83 (2003) 1-12
51. Shabtay D., and Steiner G. Two due date assignment problems in scheduling a single machine. Operations Research Letters 34 (2006) 683-691
52. Shabtay D., and Steiner G. Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manufacturing and Service Operations Management 9 (2007) 332-350
53. Szwarc W. Single machine total tardiness problem revisited. In: Ijiri Y. (Ed). Creative and Innovative Approaches to the Science of Management (1993), Quorum Books, Westport, CT, USA 407-419
54. Szwarc W. Decomposition in single-machine scheduling. Discrete Applied Mathematics 83 (1998) 271-287
55. Szwarc W. Some remarks on the decomposition properties of the single machine total tardiness problem. European Journal of Operational Research 177 (2007) 623-625
56. Szwarc W., and Mukhopadhyay S. Decomposition of the single machine total tardiness problem. Operations Research Letters 19 (1996) 243-250
57. Szwarc W., Della Croce F., and Grosso A. Solution of the single-machine total tardiness problem. Journal of Scheduling 2 (1999) 55-71
58. Szwarc W., Grosso A., and Della Croce F. Algorithmic paradoxes of the single-machine total tardiness problem. Journal of Scheduling 4 (2001) 93-104
59. Tadei R., Grosso A., and Della Croce F. Finding the pareto-optima for the total and maximum tardiness single machine problem. Discrete Applied Mathematics 124 (2002) 117-126
60. Tansel B.C., and Sabuncuoglu I. New insights on the single machine total tardiness problem. Journal of the Operational Research Society 48 (1997) 82-89
61. Tansel B.C., Kara B.Y., and Sabuncuoglu I. An efficient algorithm for the single machine total tardiness problem. IIE Transactions 33 (2001) 661-674
62. Tian Z.J., Ng C.T., and Cheng T.C.E. On the single machine total tardiness problem. European Journal of Operational Research 165 (2005) 843-846
63. Wilkerson L.J., and Irwin J.D. An improved method for scheduling independent tasks. AIIE Transactions 3 (1971) 239-245
64. Woeginger G.J. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?. INFORMS Journal on Computing 12 (2000) 57-74
65. Yu W. Augmentation of consistent partial orders for the one machine total tardiness problem. Discrete Applied Mathematics 68 (1996) 189-202
66. Yu, W., 1996b. The two-machine flow shop with delays and the one-machine total tardiness problem. Ph.D. Dissertation, Eindhoven University of Technology, The Netherlands.