Improved heuristics for the early/tardy scheduling problem with no idle time

Computers and Operations Research

Volumn 32, Issue 3, 2005, Pages 557-569

  Valente, Jorge M S ^a   Alves, Rui A F S ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Dispatch rules; Dominance rules; Early tardy; Heuristics; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; COSTS; FUNCTIONS; HEURISTIC METHODS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SCHEDULING;

DISPATCH RULES; DOMINANCE RULES; EARLY/TARDY;

PROBLEM SOLVING;

EID: 4744370447     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.08.003     Document Type: Article

References (9)

1. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362.
2. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties. a review Operations Research. 38:1990;22-36.
3. Ow P.S., Morton E.T. The single machine early/tardy problem. Management Science. 35:1989;177-191.
4. Li G. Single machine earliness and tardiness scheduling. European Journal of Operational Research. 96:1997;546-558.
5. Abdul-Razaq T., Potts C.N. Dynamic programming state-space relaxation for single machine scheduling. Journal of the Operational Research Society. 39:1988;141-152.
6. Liaw C.-.F. A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research. 26:1999;679-693.
7. Fadlalla A., Evans J.R., Levy M.S. A greedy heuristic for the mean tardiness sequencing problem. Computers & Operations Research. 21:1994;329-336.
8. Volgenant A., Teerhuis E. Improved heuristics for the n-job single-machine weighted tardiness problem. Computers & Operations Research. 26:1999;35-44.
9. Lee Y.H., Bhaskaran K., Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions. 29:1997;45-52.