Journal
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Volume 23, Issue 3, Pages 393-405Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0217595906000978
Keywords
scheduling; early/tardy; heuristics; genetic algorithms; random keys
Categories
Ask authors/readers for more resources
In this paper, we present a hybrid genetic algorithm for a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys. The genetic algorithm is used to establish the order in which the jobs are initially scheduled, and a local search procedure is subsequently applied to detect possible improvements. The approach is tested on a set of randomly generated problems and compared with existing efficient heuristic procedures based on dispatch rules and local search. The computational results show that this new approach, although requiring slightly longer computational times, is better than the previous algorithms in terms of solution quality.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available