Resource scheduling with permutation based representations: Three applications

Darrell Whitley, Andrew Sutton, Adele Howe, Laura Barbulescu

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

Abstract

Resource based scheduling using permutation based representations is reviewed. Permutation based representations are used in conjunction with genetic algorithms and local search algorithms for solving three very different scheduling problems. First, the Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory. Second, scheduling the Air Force Satellite Control Network (AFSCN) involves scheduling customer requests for contact time with a satellite via a ground station, where slot times on a ground station is the limited resource. The third application is scheduling the tracking of objects in space using ground based radar systems. Both satellites and debris in space must be tracked on regular basis to maintain knowledge about the location and orbit of the object. The ground based radar system is the limited resource, but unlike AFSCN scheduling, this application involves significant uncertainty.

Original languageEnglish (US)
Title of host publicationShape Understanding System
Subtitle of host publicationThe First Steps toward the Visual Thinking Machines
EditorsZbigniew Les, Magdalena Les
Pages219-243
Number of pages25
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume86
ISSN (Print)1860-949X

Keywords

  • Genetic algorithms
  • Local search
  • Permutations
  • Representation
  • Resource scheduling

Fingerprint

Dive into the research topics of 'Resource scheduling with permutation based representations: Three applications'. Together they form a unique fingerprint.

Cite this