We consider the problem of how best to assign the service effort in a queueing network in order to minimize the expected delay under a cost constraint. We shall study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time ...

We consider a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Customers from several priority classes arrive at an individual station according to independent batch Bernoulli processes. We assume a non-preemptive priority rule and non-zero switch-over times of the server between consecutive stations. 'Ve derive an exact expression for a weighted s...

We consider the problem of how best to assign the service effort in a queueing network in order to minimise the expected delay under a cost constraint. We shall study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time ...

Social media are increasingly used to disseminate emergency warnings, alerts, and other hazard-related information. In this context, the timing of information propagation is of immediate interest. Time-sensitive information must reach members of the general public before the pertinence of the information expires. In this research we build a preliminary model for the time between information dis...

This paper presents an algorithmic procedure to calculate the delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on his waiting time. We consider three different situations: impatient customers in the waiting room, impatient customers in the system, that is, if a customer has been in the waiting room, respec...

The study sought to test the industry wide claim in fast-food restaurant that they deliver pizza within 10 minutes of waiting. further assess extent which actual waiting period for differs from perceived time. A sample 500 transactions had their order cycle time measured, and corresponding was also recorded surveyed respondents who initiated transactions. revealed there are statistically signif...

In this paper, we study the dynamic pricing problem of a multi-server facility that processes requests from several customer classes on a first come first served basis. We assume an arrival belongs to one of a finite number of customer classes and that each class is distinguished by known and arbitrary service valuations and arbitrary but non-decreasing waiting cost functions. We model the faci...

A queue is a waiting line (like customers waiting at a supermarket checkout counter); queueing theory is the mathematical theory of waiting lines. More generally, queueing theory is concerned with the mathematical modeling and analysis of systems that provide service to random demands. A queueing model is an abstract description of such a system. Typically, a queueing model represents (1) the s...

We consider a duopoly where firms compete on waiting times in the presence of an industry benchmark. The demand captured by a firm depends on the gap between the firm’s offer and the benchmark. We refer to the benchmark effect as the impact of this gap on demand. The formation of the benchmark is endogenous and depends on both firms’ choices. When the benchmark is equal to the shorter of the tw...

Large-scale service systems, where many servers respond to high demand, are appealing because they can provide great economy of scale, producing a high quality of service with high efficiency. Customer waiting times can be short, with a majority of customers served immediately upon arrival, while server utilizations remain close to 100%. However, we show that this confluence of quality and effi...