Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem

Journal of the Operational Research Society

Volumn 48, Issue 6, 1997, Pages 640-646

  Russell, R M ^a   Holsenback, J E ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b Savannah State College   (United States)

Author keywords

Heuristics; Net benefit of relocation; Scheduling; Sequencing; Single machine; Total tardiness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PRODUCTION;

NET BENEFIT OF RELOCATION; SEQUENCING; SINGLE MACHINE; TOTAL TARDINESS;

SCHEDULING;

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

References (7)

1. Du J., Leung J Y T., (1990). Minimizing total tardiness on one machine is NP-hard. Math Op Res 15: 483-495.
2. Potts C N., Van Wassenhove L N., (1991). Single machine tardiness sequencing heuristics. IIE Trans 23: 346-354.
3. Matsuo H., Suh C J., Sullivan R S., (1989). A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann Op Res 21: 85-108.
4. Emmons H., (1969). One machine sequencing to minimize certain functions of job tardiness. Op Res 17: 701-715.
5. Conway R W., Maxwell W L., Miller L W., (1967). Theory of Scheduling. Addison-Wesley: Reading, Mass.
6. Fisher M L., (1976). A dual algorithm for the one-machine scheduling problem. Math Program 11: 229-251.
7. Schrage L E., Baker K R., (1978). Dynamic programming solution of sequencing problems with precedence constraints. Op Res 26: 444-449.