TITLE

FIXED JOB SCHEDULING WITH TWO TYPES OF PROCESSORS

AUTHOR(S)
Dondet, V. R.; Emmons, Hamilton
PUB. DATE
January 1992
SOURCE
Operations Research;Jan/Feb92 Supplement 1, Vol. 40 Issue 1, p76
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We consider a scheduling problem that involves two types of processors, but three types of jobs. Each job has a fixed start time and a fixed completion time, and falls into one of three types. Jobs of type 1 can be done only by type-1 processors, type-2 jobs only by type-2 processors, and type-0 jobs by either type of processors. We present a polynomial algorithm for finding the minimal cost combination of the two types of processors required to complete all jobs. The steps of the algorithm consist of constructing a job schedule network, transforming it into a single-commodity flow problem and finding the maximal flow through it.
ACCESSION #
4482492

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics