Robustness of efficient server assignment policies to service time distributions in finite-buffered lines
From MaRDI portal
Publication:3588808
DOI10.1002/nav.20424zbMath1230.90065OpenAlexW2035133025MaRDI QIDQ3588808
Hayriye Ayhan, Sigrún Andradóttir, Eser Kırkızlar
Publication date: 10 September 2010
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20424
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (8)
Sample Path Optimal Policies for Serial Lines with Flexible Workers ⋮ Optimal assignment of servers to tasks when collaboration is inefficient ⋮ Flexible servers in tandem lines with setup costs ⋮ Stability analysis of a two-station cascade queueing network ⋮ Profit maximization in flexible serial queueing networks ⋮ Recent advances in robust optimization: an overview ⋮ Extended Laplace principle for empirical measures of a Markov chain ⋮ A linear programming based approach for composite-action Markov decision processes
Cites Work
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- A two-stage tandem queue attended by a moving server with holding and switching costs
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Heavy traffic resource pooling in parallel-server systems
- On the introduction of an agile, temporary workforce into a tandem queueing system
- Control of a Single-Server Tandem Queueing System with Setups
- Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
- Optimal use of an extra server in a two station tandem queueing network
- Modeling and analysis of flexible queueing systems
- Optimal control of two interacting service stations
- Compensating for Failures with Flexible Servers
- MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS
- Performance of Bucket Brigades When Work Is Stochastic
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- Optimal control of service in tandem queues
- Self-Buffering, Self-Balancing, Self-Flushing Production Lines
- Optimal control of a flexible server
- A robust policy for serial agile production systems
- OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS
- Principles on the Benefits of Manufacturing Process Flexibility
- A Production Line that Balances Itself
- Allocation of interdependent resources for maximal throughput
- Optimal stochastic scheduling of a two-stage tandem queue with parallel servers
- Dynamic Allocation of Reconfigurable Resources in a Two-Stage Tandem Queueing System With Reliability Considerations
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers
- Dynamic load balancing with flexible workers
- DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES
This page was built for publication: Robustness of efficient server assignment policies to service time distributions in finite-buffered lines
