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

DOI10.1016/S0947-3580(97)70084-0zbMATH Open0895.90098OpenAlexW2047734644MaRDI QIDQ1383471FDOQ1383471

Authors: 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

Recommendations

• Machine interference with general repair and running times
• On a machine interference problem with several types of machines attended by a single repairman
• scientific article; zbMATH DE number 3854170
• A machine interference problem with multiple types of failures
• On the \(M/G/1\) machine interference model with spares

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
• Manufacturing flow line systems: A review of models and analytical results
• Approximate Analysis of General Queuing Networks by Decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Performance analysis of Markovian polling systems with single buffers
• 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
• Performance analysis of finite capacity polling systems with nonexhaustive service

Cited In (3)

• Transient analysis of a finite source discrete-time queueing system using homogeneous Markov system with state size capacities (HMS/c)
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383471)