2006
DOI: 10.1016/j.peva.2005.09.001
|View full text |Cite
|
Sign up to set email alerts
|

Approximating multi-skill blocking systems by HyperExponential Decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
35
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(35 citation statements)
references
References 5 publications
0
35
0
Order By: Relevance
“…A possible remedy is to use stationary blocking models (Franx et al, 2006) of multi-skill call centers. However, this excludes modeling the carry-over of backlog such as unanswered e-mails or call retrials.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A possible remedy is to use stationary blocking models (Franx et al, 2006) of multi-skill call centers. However, this excludes modeling the carry-over of backlog such as unanswered e-mails or call retrials.…”
Section: Introductionmentioning
confidence: 99%
“…Bhulai et al (2006) present a two-step approach to solve the staffing (Step 1) and shift scheduling (Step 2) problem for multi-skill call centers of a realistic size. In Step 1, stationary blocking models (Franx et al, 2006) of multi-skill call centers are used to determine staffing levels for each interval. Given these required staffing levels, shift schedules are created via integer programming in Step 2 to meet these staffing requirements.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, approximative methods are needed for performance analysis (see Kelly [7] for a broad overview). Classical approximation techniques such as the equivalent random method and the Hayward-Fredericks method [14], and the recently introduced hyperexponential decomposition (Franx, Koole, and Pot [3]), are based on parametrically modeling the overflow processes from the first layer by simpler processes. These methods have been observed to produce good approximations for many choices of system parameters.…”
Section: Introductionmentioning
confidence: 99%
“…A common problem is then how to meet the service-level agreements while keeping the disturbance of the back office operators to a minimum; see [14] and references therein. Overflow problems are in general difficult to analyze, see [11], because the overflow traffic is not Poisson; the deterministic threshold of this model only adds to this. We believe though that the model is of independent interest and has its applications in other areas where the service level involves the (tail) distribution of the waiting time, as in, for example, telecommunication and production systems, or in supply chains with lead time decisions [20].…”
mentioning
confidence: 99%