Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Assigning a single server to inhomogeneous queues with switching costs

5 references·11 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1985The c μ rule revisited236 cited
1971Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server154 cited
1992On optimal polling policies123 cited
1987On the Optimal Control of Two Queues with Server Setup Times and Its Analysis104 cited
1998Dynamic Scheduling of a Two-Class Queue with Setups89 cited

Cited by

2004A survey on the bandit problem with switching costs88 cited
2001Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem46 cited
2018Polling: past, present, and perspective45 cited
2005Optimal and heuristic policies for dynamic server allocation35 cited
2004Optimal Server Allocation in Reconfigurable Clusters with Multiple Job Types27 cited
2021Capacity Allocation of an Integrated Production and Service System23 cited
2021Customer Acquisition and Retention: A Fluid Approach for Staffing23 cited
2000On the value function of a priority queue with an application to a controlled polling model22 cited
1995Polling Models with Threshold Switching20 cited
1998Beyond the cμ rule: Dynamic scheduling of a two-class loss queue

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

18 cited

2009Allocating flexible servers in serial systems with switching costs13 cited