Scheduling algorithms

William J. Wolfe; David Wood; Stephen E. Sorensen

doi:10.1117/12.262508

19 December 1996 Scheduling algorithms

William J. Wolfe, David Wood, Stephen E. Sorensen

Proceedings Volume 2911, Advanced Sensor and Control-System Interface; (1996) https://doi.org/10.1117/12.262508
Event: Photonics East '96, 1996, Boston, MA, United States

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.

Citation Download Citation

William J. Wolfe, David Wood, and Stephen E. Sorensen "Scheduling algorithms", Proc. SPIE 2911, Advanced Sensor and Control-System Interface, (19 December 1996); https://doi.org/10.1117/12.262508

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available