An efficient method to determine the optimal configuration of a flexible manufacturing system
DOI10.1007/BF02186797zbMath0708.90037MaRDI QIDQ920833
Publication date: 1988
Published in: Annals of Operations Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved balanced job bound analysis of closed queueing networks
- On queueing network models of flexible manufacturing systems
- The optimal design of flexible manufacturing systems
- Robustness of queuing network formulas
- Optimal Server Allocation in a System of Multi-Server Stations
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Closed Queuing Systems with Exponential Servers
- Computational algorithms for closed queueing networks with exponential servers
This page was built for publication: An efficient method to determine the optimal configuration of a flexible manufacturing system