Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Threshold-based priority policies for parallel-server systems with affinity scheduling

4 references·8 citing·41 second hop

FromToDepth

this work references cited by second hop

References

1999Heavy traffic resource pooling in parallel‐server systems238 cited
1998Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies182 cited
1992Resource pooling in queueing networks with dynamic routing110 cited
2000On dynamic scheduling of a parallel server system with complete resource pooling52 cited

Cited by

2018Design heuristic for parallel many server systems43 cited
2020Assigning spontaneous volunteers to relief efforts under uncertainty in task demand and volunteer availability38 cited
2007Compensating for Failures with Flexible Servers35 cited
2007DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES29 cited
2008Pooling is not the answer24 cited
2019Redundancy scheduling with scaled Bernoulli service requirements22 cited
2019Redundancy scheduling with scaled Bernoulli service requirements21 cited
2011The “W” network and the dynamic control of unreliable flexible servers19 cited

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