Resource title

Local search heuristics for single machine tardiness sequencing

Resource image

image for OpenScout resource :: Local search heuristics for single machine tardiness sequencing

Resource description

This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. A genetic algorithm is developed which employs a new binary encoding scheme to represent solutions and uses a heuristic method to convert the representation into a sequence. This algorithm is compared to descent, simulated annealing and tabu search methods on a large set of test problems. The computational results indicate that tabu search performs better than the order two neighbourhood search methods. However, the genetic algorithm generally produces superior solutions and it also appears to be a robust heuristic

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/Inseadwp1994/94-52.pdf

Resource license

Copyright INSEAD. All rights reserved