Many scholars study shows that the background music is restaurant controllable environmental factor that can affect the customer waiting time, which has some management implications for solving customer wait time problem in the service sector. This article used experimental management method, randomly selected a large restaurant, and then observed each customer just coming in, recorded backgrou...

This paper studies a Geo/Geo/1+GI queue in which the abandonments are endogenous. One crucial feature of this model is that the abandonment behavior is affected by the system performance and vice versa. Our model captures this interaction by developing two closely related models: an abandonment model and a queueing model. In the abandonment model, customers take the virtual waiting time distrib...

We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g. time zero). There is one server, and the service times are independent and exponentially distributed. The total number of customers that demand service is random, and follows the Poisson distribution. Each customer wishes to minimize the sum of three costs: earliness...

We consider an M/G/1 queueing system where the customers may leave the queue if their services do not commence before an exponentially distributed random time. The (conditional) offered waiting time distribution is approximated by a gamma distribution via matching the first and second moments of the actual waiting time. Simulation study is conducted to assess the accuracy of the approximation a...

In many congestion problems, the customers may not like to join a long queue and may balk. To reduce the balking behavior of the customers, the provision of additional servers can be made in such situations. In the present paper, we investigate a Markovian queueing model with balking, interdependent rates and additional servers under no passing constraint. Due to nopassing restriction, the cust...

We analyze an M/M/1 queue with a service discipline in which customers, upon arriving when the server is busy, search a sequence of stations for a vacant station at which to wait, and in which the server, upon becoming free when one or more customers are waiting, searches the stations in the same order for a station occupied by a customer to serve. We show how to find complete asymptotic expans...

AbstractIn this paper, a single server bulk service queuing system with interrupted vacation, request for Re-service and Balking is considered. At a service completion, if the server finds at least „a‟ customers waiting for service say ξ, he serves a batch of min (ξ ,b ) customers, whereb ≥ a. At the completion of an essential service, the leaving batch of customers may request for a re-service...

We consider queueing systems in which customers arrive according to a Poisson process and have exponentially distributed service requirements. The customers are impatient and may abandon the system while waiting for service after a generally distributed amount of time. The system incurs customer-related costs that consist of waiting and abandonment penalty costs. We study capacity sizing in suc...

We consider the pricing/lead-time menu design problem for a monopoly service where time-sensitive customers have demand on multiple occasions. Customers differ in their demand rates and valuations per use. We compare a model where the demand rate is the private information of the buyers to a model where the firm has full information. The model assumes that customers queue for a finite-capacity ...

We consider a nonstationary Markov multiserver queueing model where waiting customers may abandon and subsequently retry. In this paper we derive uid and di usion approximations for the associated waiting time process. The uid and di usion approximations for the corresponding queue length process were obtained in [4] (see also [5]).