A simple proof of the optimality of a threshold policy in a two-server queueing system
Systems & Control Letters
A two-level traffic shaper for an on-off source
Performance Evaluation
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects
Manufacturing & Service Operations Management
Engineering Solution of a Basic Call-Center Model
Management Science
Fundamentals of Queueing Theory
Fundamentals of Queueing Theory
Queues with waiting time dependent service
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We introduce a new approach to modelling queueing systems where the priority or the routing of customers depends on the time the first customer has waited in the queue. This past waiting time of the first customer in line, WFIL, is used as the primary variable for our approach. A Markov chain is used for modelling the system where the states represent both the number of free servers and a discrete approximation to WFIL. This approach allows us to obtain waiting time distributions for complex systems, such as the N-design routing scheme widely used, e.g., in call centers and systems with dynamic priorities.