This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Contrary to earlier algorithms which only move vehicles to known customers, this paper investigates waiting and relocation strategies in which vehicles may wait at their current location or relocate to arbitrary site...

ABSTRACT We analyze a single server queue with modified Bernoulli server vacations based on exhaustive service. Unlike other vacation policies, we assume that only at the completion of service of the last customer in the system, the server has the option to take a vacation or to remain idle in the system waiting for the next customer to arrive. The service times of the customers have been assum...

In situations of excess demand, many firms use waiting lists to allocate products and services among their customers. The resulting allocation is likely to be inefficient, creating opportunities for Pareto improving trades among those who are waiting in line. Yet, in the queuing context, the trading of places is rare and inefficiencies often persist over time. In this paper, I report the result...

Many service providers utilize priority queues. Many consumers revile priority queues. However, some form of priority service may be necessary to maximize social welfare. Consequently, it is useful to understand how the priority scheme chosen by a revenue-maximizing firm differs from that a social planner would impose. We examine this in a single server-queue with customers that draw their valu...

Abstract: In the paper we deal with a Markovian queueing system with two heterogeneous servers and constant retrial rate. The system operates under a threshold policy which prescribes the activation of the faster server whenever it is idle and a customer tries to occupy it. The slower server can be activated only when the number of waiting customers exceeds a threshold level. The dynamic behavi...

We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server...

We consider a queueing system with multiple heterogeneous servers serving a multiclass population. The classes are distinguished by time costs. All customers have i.i.d. service requirements. Arriving customers do not see the instantaneous queue occupancy. Arrivals are randomly routed to one of the servers and the routing probabilities are determined centrally to optimize the expected waiting c...

introduction: emergency department is one of the most important hospital wards that offers emergency services to unstable patients 24 hours a day, 7 days a week. however, the way the services are offered reflects the general status of the hospital since patients with the most serious problems frequently refer to the emergency department. emergency department waiting time is one of the indices u...

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...