Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure

R. S. Garfinkel and W. J. Plotnicki
Additional contact information
R. S. Garfinkel: University of Tennessee, Knoxville, Tennessee
W. J. Plotnicki: Colorado State University, Fort Collins, Colorado

Operations Research, 1980, vol. 28, issue 5, 1236-1240

Abstract: Jobs arrive at a facility in a periodic way, each requiring the same set of tasks with a serial precedence structure. Only a fixed number of tasks can be performed in any period. The number of periods is also given so that jobs not completed in the final period are continued in the first. The problem of minimizing total delay is shown to be solvable analytically. The model is motivated by the application of scheduling courses to quarters to minimize student delay in an academic program.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.5.1236 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:5:p:1236-1240

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().