Stochastic Analysis of Cyclic Schedules

R. A. Bowman and J. A. Muckstadt
Additional contact information
R. A. Bowman: Union College, Schenectady, New York
J. A. Muckstadt: Cornell University, Ithaca, New York

Operations Research, 1993, vol. 41, issue 5, 947-958

Abstract: A cyclic schedule is a sequence of tasks on a set of machines that is repeated indefinitely. We model cyclic schedules as Markov chains and use ergodic theory to analyze and improve the performance of cyclic schedules in environments with machine breakdowns, yield losses, and other sources of variability. The concept of cyclic task criticality is developed as a natural extension of task criticalities in PERT networks. We show that cyclic task criticalities can and should be used to guide the management of cyclic schedules.

Keywords: production/scheduling: cyclic; project management; PERT: Markovian networks (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.5.947 (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:41:y:1993:i:5:p:947-958

Access Statistics for this article

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