Interchange arguments for classical scheduling problems in queues
Systems & Control Letters
Stochastic dynamic programming and the control of queueing systems
Stochastic dynamic programming and the control of queueing systems
Dynamic Programming and Optimal Control, Two Volume Set
Dynamic Programming and Optimal Control, Two Volume Set
A two-stage tandem queue attended by a moving server with holding and switching costs
Queueing Systems: Theory and Applications
Optimality of D-Policies for an M/G/1 Queue with a Removable Server
Queueing Systems: Theory and Applications
Control of a Single-Server Tandem Queueing System with Setups
Operations Research
Dynamics of Two- and Three-Worker "Bucket Brigade" Production Lines
Operations Research
Dynamic Control of a Queue with Adjustable Service Rate
Operations Research
Performance of Bucket Brigades When Work Is Stochastic
Operations Research
OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS
Probability in the Engineering and Informational Sciences
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES
Probability in the Engineering and Informational Sciences
Queueing Systems: Theory and Applications
TECHNICAL NOTE---Queueing Systems with Synergistic Servers
Operations Research
Optimal stochastic scheduling of two interconnected queues with varying service rates
Operations Research Letters
Optimal assignment of servers to tasks when collaboration is inefficient
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider a two-station tandem queueing system where customers arrive according to a Poisson process and must receive service at both stations before leaving the system. Neither queue is equipped with dedicated servers. Instead, we consider three scenarios for the fluctuations of workforce level. In the first, a decision-maker can increase and decrease the capacity as is deemed appropriate; the unrestricted case. In the other two cases, workers arrive randomly and can be rejected or allocated to either station. In one case the number of workers can then be reduced (the controlled capacity reduction case). In the other they leave randomly (the uncontrolled capacity reduction case). All servers are capable of working collaboratively on a single job and can work at either station as long as they remain in the system. We show in each scenario that all workers should be allocated to one queue or the other (never split between queues) and that they should serve exhaustively at one of the queues depending on the direction of an inequality. This extends previous studies on flexible systems to the case where the capacity varies over time. We then show in the unrestricted case that the optimal number of workers to have in the system is non-decreasing in the number of customers in either queue.