On a machine interference problem with several types of machines attended by a single repairman

DOI10.1080/00207548308942388zbMath0542.90042OpenAlexW1978181548MaRDI QIDQ3330949

M. Jeya Chandra, J. George Shanthikumar

Publication date: 1983

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548308942388

zbMATH Keywords

algorithmsingle repairmanmachine interference problemsteady state probability distributionimbedded Markov chain modelseveral types of machines

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Probabilistic methods, stochastic differential equations (65C99)

Related Items (2)

A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\) ⋮ Multiple finite source queueing model with dynamic priority scheduling

Cites Work

• Priority queues
• Central Server Model for Multiprogrammed Computer Systems with Different Classes of Jobs
• On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
• Simple Machine Interference with Two Types of Failure

This page was built for publication: On a machine interference problem with several types of machines attended by a single repairman