Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues
From MaRDI portal
Publication:4330237
DOI10.1002/nav.1045zbMath1001.90020OpenAlexW2019861027MaRDI QIDQ4330237
V. D. Dinopoulou, Costis Melolidakis
Publication date: 15 May 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.1045
Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80) Reliability and life testing (62N05) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cites Work
- Unnamed Item
- When is greedy module assembly optimal?
- On the Optimality of the Generalized Shortest Queue Policy
- Deciding Which Queue to Join: Some Counterexamples
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Optimal Assignment of Components to a Two-Stage k-Out-of-n System
- Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Assembly of systems having maximum reliability
- On optimal assembly of systems