A note on the equivalence of two heuristics to minimize total tardiness

European Journal of Operational Research

Volumn 96, Issue 3, 1997, Pages 514-517

  Alidaee, Bahram ^a   Gopalan, Suresh ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b WEST TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Modified due date rule; Single machine; Tardiness

Indexed keywords

COMPUTATIONAL COMPLEXITY; MACHINERY; OPTIMIZATION; PRODUCTION; SCHEDULING;

MODIFIED DUE DATE RULE; SINGLE MACHINE; TARDINESS;

HEURISTIC METHODS;

EID: 0031076096     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(95)00255-3     Document Type: Article

References (17)

1. Baker, K.R., and Bertrand, J.W., "A dynamic priority rule for scheduling against due-dates", Journal of Operations Management 3 (1982) 37-42.
2. Baker, K.R., and Kanet, JJ., "Job shop scheduling with modified due-dates", Journal of Operations Management 4 (1983) 11-22.
3. Baker, K.R., and Martin, J.B., "An experimental comparison of solution algorithms for the Single Machine Total Tardiness Problem", Naval Research Logistics Quarterly 21 (1984) 187-199.
4. Baker, K.R., Introduction to Sequencing and Scheduling, Wiley, New York, 1994.
5. Cheng, T.C., "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.
6. Du, J., and Leung, J.Y., "Minimizing total tardiness on one machine is NP-hard", Mathematics of Operations Research 15 (1990) 483-495.
7. Fry, T.D., Vinces, L., MacLeod, K., and Femandez, S., "A heuristic solution procedure to minimize T̄ on a single machine", Journal of the Operational Research Society 40 (1989) 293-297.
8. Ho, J.C., and Chang, Y.-L.C., "Heuristic for minimizing mean tardiness for m parallel machines", Naval Research Logistics 38 (1991) 367-381.
9. 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.
10. Koulamas, C., "The total tardiness problem: Review and extensions", Operations Research 42 (1994) 1025-1041.
11. Lawler, E., "A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness", Annals of Discrete Mathematics 1 (1977) 331-342.
12. Potts, C.N., and Van Wassenhove, L.N, "A decomposition algorithm for the Single Machine Total Tardiness Problem", Operations Research Letters 32 (1982) 177-181.
13. Potts, C.N., and Van Wassenhove, L.N, "Dynamic programming and decomposition approaches for the Single Machine Total Tardiness Problem", European Journal of Operational Research 32 (1987) 405-414.
14. Panwalkar, S.S., Smith, M., and Koulamas, C.P., "A heuristic for the Single Machine Tardiness Problem", European Journal of Operational Research 70 (1993) 304-310.
15. Rachamadugu, R.M., "A note on the Weighted Tardiness Problem", Operations Research 35 (1987) 450-452.
16. Vepsalainen, A.P., and Morton, T.E., "Priority rules for job shop with weighted tardiness costs", Management Science 33 (1987) 1035-1047.
17. Wilkerson, L.J., and Irwin, J.D., "An improved algorithm for scheduling independent tasks", AIIE Transactions 3 (1971) 293-245.