.png){kind=icon}
.png){kind=icon}
Return
Ranking flexibility structures in queueing systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.09.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of comparing flexibility structures in queueing systems. We find that an important issue in evaluating flexibility is that one cannot separately consider the design of a flexibility structure and the choice of a server scheduling policy. We propose a policy that leverages flexibility in a more predictable (and typically more effective) manner than several common policies and find that the proposed policy is a useful basis for comparisons. In terms of evaluating flexibility, we take as a starting point the CF index of Iravani, Kolfal, and van Oyen (2011) and find that by breaking it down to its components, we are able to identify scenarios in which the CF index may incorrectly compare flexibility structures in systems with heterogeneous variability in the underlying interarrival time and service requirement distributions. For such scenarios, we propose a distribution-dependent metric for performing the ranking. A consequence of our observations is the ability to construct partial rankings that appear to be relatively insensitive to the underlying distributions. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Queueing
Flexible servers
Scheduling policy
Heterogeneous variability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W