Performance analysis of a call center with interactive voice response units. (Q703289): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jin-Ting Wang / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q591570 / rank
Normal rank
 
Property / author
 
Property / author: Jin-Ting Wang / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q54138309 / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jevsey Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson Arrivals See Time Averages / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02578926 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092214701 / rank
 
Normal rank

Latest revision as of 08:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Performance analysis of a call center with interactive voice response units.
scientific article

    Statements

    Performance analysis of a call center with interactive voice response units. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    Consider a Markovian model of a call center with Poisson input, \(N\) trunk lines and a number (not less than \(N\)) of telephone sales agents. As a rule, a call center contains also the automatic call distributor (ACD) and a voice response unit (VRU). If a trunk line is free, then arriving call spends (exponential) time at the VRU. Then it may leave the system or is routed to an agent for an assistance (or wait at ACD until an agent becomes free). Once a call completes its transaction with an agent it releases both the trunk line and the agent. A call finding all trunk lines and agents busy is lost. To find the probability of the loss, the system is described as a two-station tandem network with multiserver stations. A two-dimensional Markov chain (the number of busy trunk lines and the number of busy agents) is studied to obtain the stationary distribution of the number of calls in the center. Numerical examples are included and a relation with the known Erlang's loss formula is discussed.
    0 references
    flow controlled Jackson networks
    0 references
    Erlang formulae
    0 references
    0 references
    0 references

    Identifiers