Share Email Print

Proceedings Paper

Scheduling algorithms
Author(s): William J. Wolfe; David Wood; Stephen E. Sorensen
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper discusses automated scheduling as it applies to complex domains such as factories, transportation, and communications systems. The window-constrained-packing problem is introduced as an ideal model of the scheduling trade offs. Specific algorithms are compared in terms of simplicity, speed, and accuracy. In particular, dispatch, look-ahead, and genetic algorithms are statistically compared on randomly generated job sets. The conclusion is that dispatch methods are fast and fairly accurate; while modern algorithms, such as genetic and simulate annealing, have excessive run times, and are too complex to be practical.

Paper Details

Date Published: 19 December 1996
PDF: 12 pages
Proc. SPIE 2911, Advanced Sensor and Control-System Interface, (19 December 1996); doi: 10.1117/12.262508
Show Author Affiliations
William J. Wolfe, Univ. of Colorado/Denver (United States)
David Wood, Univ. of Colorado/Denver (United States)
Stephen E. Sorensen, Hughes Information Technology Systems (United States)

Published in SPIE Proceedings Vol. 2911:
Advanced Sensor and Control-System Interface
Bartholomew O. Nnaji, Editor(s)

© SPIE. Terms of Use
Back to Top