We propose a model for abandonments from a queue, due to excessive wait, assuming that waiting customers act rationally but without being able to observe the queue length. Customers are allowed to be heterogeneous in their preferences and consequent behavior. Our goal is to characterize customers’ patience via more basic primitives, specifically waiting costs and service benefits: these two are...

We consider an (s,S) inventory system with random lead time and repeated demands of unsatisfied demands from the orbit. Whenever the inventory level falls to the level s, an order is placed to bring the level to S. The quantity ordered is M = S− s. Demands to the system are served immediately if there is a positive inventory. Otherwise it will go to a pool of unsatisfied customers called orbit....

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...

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...

Abstract: In this paper, we study a discrete time queueing system with multiple types of customers and a last-come-first-served general preemptive resume (LCFS-GPR) service discipline (MMAP[K]/PH[K]/1/LCFS-GPR). When the waiting space is infinite, matrix analytic methods are used to find a system stability condition, to derive the distributions of the busy periods and sojourn times, and to obta...