New insights on the single machine total tardiness problem

Journal of the Operational Research Society

Volumn 48, Issue 1, 1997, Pages 82-89

  Tansel, B C ^a   Sabuncuoglu, I ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Single machine scheduling; Tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MACHINERY; OPTIMIZATION;

SINGLE MACHINE SCHEDULING; SINGLE MACHINE TOTAL TARDINESS PROBLEM;

SCHEDULING;

EID: 0030717842     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600321     Document Type: Article

References (19)

1. Lenstra, J. K., Rinnooy Kan, A. H. G., Brucker, P., (1977).Complexity of machine scheduling problems, Annals of DiscMath 1: 343-362.
2. Du, J. L., eung, J. Y. T., (1990). Minimizing total tardiness on onemachine is NP-hard, Math Opns Res 15: 483-495.
3. Emmons, H., (1969). One-machine sequencing to minimizecertain functions of job tardiness, Opns Res 17: 701-715.
4. Rinnooy Kan, A. H. G., Lageweg BJ Lenstra, J. K., (1975).Minimizing total costs in one machine scheduling, Opns Res23: 908-927.
5. Fisher, M. L., (1976). A dual algorithm for the one machinescheduling problem, Math Prog;11: 229-251.
6. Schrage, L. E., Baker, K. R., (1978). Dynamic programmingsolution of sequencing problem with precedence constraints., Opns Res 26: 444-449.
7. Baker, K. R., Schrage, L. E., (1978). Finding an optimalsequence by dynamic programming: an extension to precedence related tasks, Opns Res 26: 111-120.
8. Sen, T. T., Austin, L. M., Ghandforoush, P., (1983). An algorithmfor the single machine sequencing problem to minimize totaltardiness, IIE Transactions 15: 363-366.
9. Sen, T. T., Borah, B. N., (1991). On the single machine schedulingproblem with tardiness penalties, J Opl Res Soc 42: 695-702.
10. Lawler, E. L., (1977). A pseudopolynomial algorithm for sequencingjobs to minimize total tardiness, Annals of Disc Math 1:331-342.
11. Potts, C. N., Van Wassenhove, L. N., (1982). A decompositionalgorithm for the single machine total tardiness problem, OpnsRes Letters 11: 177-181.
12. Potts, C. N., Van Wassenhove, L. N., (1987). Dynamic programmingnd decomposition approaches for the single machinetotal tardiness problem, Eur J Opl Res 32: 405-414.
13. Wilkerson, L. J., Irwin, J. D., (1971). An improved algorithm forscheduling independent tasks, AIIE Transactions 3: 239-245.
14. Fry, T. D., Vincent, L., Macleod K., Fernandez, S., (1989). Aheuristic solution procedure to minimize mean tardiness on asingle machine, J Opl Res Soc 40: 293-297.
15. Potts, C. N., Van Wassenhove, L. N., (1991). Single machinetardiness sequencing heuristics, IIE Transactions 23: 346-354.
16. Holsenback, J. E., Russell, R. M., (1992). A heuristic algorithmfor sequencing on one machine to minimize total tardiness, JOpl Res Soc 43: 53-62.
17. Panwalkar, S. S., Smith M. L., Koulamas, C. P., (1993). A heuristicfor the single machine tardiness problem, Eur J Opl Res 70:304-310.
18. Baker, K. R., (1974). Introduction to SequencingScheduling.Wiley: New York.
19. Rachamadugu, R., (1995). Scheduling jobs with proportionateearly=tardy penalties, IIE Transactions 27: 679-682.