Open AccessStochastic Analysis of Cyclic Schedules
Author(s) -
R. Alan Bowman,
John A. Muckstadt
Publication year - 1993
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.41.5.947
Subject(s) - task (project management) , schedule , computer science , markov chain , ergodic theory , set (abstract data type) , extension (predicate logic) , sequence (biology) , criticality , mathematical optimization , operations research , mathematics , machine learning , engineering , mathematical analysis , physics , systems engineering , biology , nuclear physics , genetics , programming language , operating system
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom