Resource title

Local search heuristic for single machine scheduling with batch set-up times

Resource image

image for OpenScout resource :: Local search heuristic for single machine scheduling with batch set-up times

Resource description

Local search heuristics are developed for a problem of scheduling jobs on a single machine. Jobs are partitioned into batches, and a set-up time is necessary when there is a switch in processing jobs from one batch to jobs of another batch. The objective is to minimize the total weighted completion time. Three alternatives neighbourhood search methods are developed: multi-start descent, simulated annealing and tabu search. The performance of these heuristics is evaluated based on a large set of test problems, and the results are also compared with those obtained by a genetic algorithm

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-07.pdf

Resource license

Copyright INSEAD. All rights reserved