Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure

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

Operations Research, 1990, vol. 38, issue 4, 629-633

Abstract: Fixed Cycle Scheduling (FCS) is a class of job scheduling problems in which all scheduling decisions (assignment of tasks to processors) are made on a cycle. That is, if task t is assigned to processor j at period h n , then the same assignment is made at period h + in , for all integers i , where n is the cycle length. Possible applications of FCSs are given and a special case with uniform job arrivals and empty precedence structure is shown to be solvable analytically.

Keywords: production/scheduling:; fixed; cycle; with; empty; precedence; structure (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.4.629 (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:38:y:1990:i:4:p:629-633

Access Statistics for this article

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