Machine allocation problems in manufacturing networks
DOI10.1016/0377-2217(90)90155-5zbMath0685.90051OpenAlexW2072484121MaRDI QIDQ1262201
Onno J. Boxma, Mario van Vliet, Alexander H. G. Rinnooy Kan
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1666
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient method to determine the optimal configuration of a flexible manufacturing system
- On queueing network models of flexible manufacturing systems
- Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
- Optimal Server Allocation in a System of Multi-Server Stations
- Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
- A Proof for the Queuing Formula: L = λW
- Note—On the Marginal Benefit of Adding Servers to G/GI/m Queues
- Note—On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues
- Discrete Optimization Via Marginal Analysis
- A Note on Marginal Allocation in Multiple-Server Service Systems
- Technical Note—Comment on an Integer Maximization Problem