Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

@article{Crauwels1998LocalSH,
  title={Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem},
  author={H. A. J. Crauwels and Chris N. Potts and Luk N. Van Wassenhove},
  journal={INFORMS Journal on Computing},
  year={1998},
  volume={10},
  pages={341-350}
}
This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. We introduce a new binary encoding scheme to represent solutions, together with a heuristic to decode the binary representations into actual sequences. This binary encoding scheme is compared to the usual 'natural' permutation representation for descent, simulated annealing, threshold accepting, tabu search and genetic algorithms on a large set of test… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 143 citations. REVIEW CITATIONS

3 Figures & Tables

Topics

Statistics

051015'99'01'03'05'07'09'11'13'15'17
Citations per Year

144 Citations

Semantic Scholar estimates that this publication has 144 citations based on the available data.

See our FAQ for additional information.