Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
From MaRDI portal
Publication:2393118
DOI10.1007/s00291-012-0293-4zbMath1282.90048OpenAlexW1985402588MaRDI QIDQ2393118
Publication date: 7 August 2013
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-012-0293-4
Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22) Production models (90B30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality of the shortest line discipline with state-dependent service rates
- Optimality of routing and servicing in dependent parallel processing systems
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Index policies for the maintenance of a collection of machines by a set of repairmen
- Join the shortest queue: Stability and exact asymptotics
- Restless bandits, partial conservation laws and indexability
- The Complexity of Optimal Queuing Network Control
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- On the Optimality of the Generalized Shortest Queue Policy
- On the Assignment of Customers to Parallel Queues
- Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Deciding Which Queue to Join: Some Counterexamples
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Variance Formulas for the Mean Difference and Coefficient of Concentration
- A simple dynamic routing problem
- On an index policy for restless bandits
- On the optimal assignment of customers to parallel servers
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
- Index policies for a class of discounted restless bandits
- Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems
- Outsourcing warranty repairs: Dynamic allocation