Translator Disclaimer
9 December 1997 Comparison of three scheduling algorithms
Author Affiliations +
Proceedings Volume 3203, Architectures, Networks, and Intelligent Systems for Manufacturing Integration; (1997)
Event: Intelligent Systems and Advanced Manufacturing, 1997, Pittsburgh, PA, United States
This paper describes three approaches to assigning tasks to resources. A fast and simple priority dispatch method is described and shown to produce acceptable schedules most of the time. A look ahead algorithm is then introduced that outperforms the dispatcher by about 12% with only a small increase in run time. These algorithms set the stage for the introduction of a genetic algorithm that uses job permutations as the population. The genetic approach presented here is novel in that it uses two additional binary variables, one to allow the dispatcher to occasionally skip a job in the queue and another to allow the dispatcher to occasionally allocate the worst legal position to the job. These variables are included in the recombination step in a natural way. The resulting schedules improve on the look ahead by as much as 15% at times and 3% on average. We define the 'window- constrained packing' problem and use it for simulations.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
William J. Wolfe and Stephen E. Sorensen "Comparison of three scheduling algorithms", Proc. SPIE 3203, Architectures, Networks, and Intelligent Systems for Manufacturing Integration, (9 December 1997);


Scheduling algorithms
Proceedings of SPIE (December 19 1996)
Genetic algorithms based on genetic grammar
Proceedings of SPIE (August 20 1992)
A method of COA based on multi-agent evolutionary algorithm
Proceedings of SPIE (October 30 2009)
School bus routing using genetic algorithms
Proceedings of SPIE (March 01 1992)
Foundations of evolutionary computation
Proceedings of SPIE (May 20 2006)

Back to Top