This paper considers the maintenance of an unreliable M/G/1 queue-like job shop, integrating the maintenance process and the resulting queue operating characteristics. The system may breakdown, leading to unscheduled maintenance. Otherwise, preventive maintenance is done when n jobs have been processed - whichever comes first. Using arguments from renewal theory, basic results regarding the queue-maintenance policy are established. Both an analytical and numerical example are studied in detail.
ASJC Scopus subject areas
- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics