Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times

DOI10.1016/S0947-3580(97)70084-0zbMath0895.90098OpenAlexW2047734644MaRDI QIDQ1383471

D. Massart

Publication date: 7 September 1998

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0947-3580(97)70084-0

zbMATH Keywords

higher momentsmachine interference problemasymmetric polling systemsingle patrolling repair person

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)

Related Items (3)

A survey of the machine interference problem ⋮ Transient Analysis of the M/M/k/N/N Queue using a Continuous Time Homogeneous Markov System with Finite State Size Capacity ⋮ Transient analysis of a finite source discrete-time queueing system using homogeneous Markov system with state size capacities (HMS/c)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Manufacturing flow line systems: A review of models and analytical results
• On modeling failure and repair times in stochastic models of manufacturing systems using generalized exponential distributions
• Limiting results for multiprocessor systems with breakdowns and repairs
• Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
• Performance analysis of finite capacity polling systems with nonexhaustive service
• Approximate Analysis of General Queuing Networks by Decomposition
• Performance analysis of Markovian polling systems with single buffers

This page was built for publication: Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times