ABSTRACf. This investigation deals with a multi server queueing model in which customers leave the system in the same chronological order in which they arrive. The customers are assumed to arrive in Poisson fashion from two infinite priority and ordinary sources and their service times are identical and exponentially distributed. The priority customers may wait but the ordinary customers are lo...

This paper studies a queueing system with a Markov arrival process and cyclic service times. When customers are distinguished by the types of their service times, the queueing processes experienced by different types of customers are different. First, a computational approach is developed to find the distributions of the queue length and waiting time of each type of customer. The results are us...

We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...

This article investigates the extent to which there is a gap between customers' perception of waiting time compared with actual waiting times; and whether this gap varies according to service context. It also investigates a new proposition that customers’ perception of time available for the service influences their perception of wait time. A field study collected 455 actual and perceived custo...

In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...

An embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the system is empty, the server remains idle (deactivates) and does not start serving the waiting customers in the queue until the number of arrivals reaches N. The service is performed in batches of min(n, N) if there are n customers waiting at the completion of service. Service times of the server depend o...

We study the workload (unfinished work) and the waiting time of the queueing system with MAP arrivals under D-policy. The D-policy stipulates that the idle server begin to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We first set up the system equations for workload and obtain the steady-state distributions of workloads at a...

M service providers offer customers the choice of either waiting in a line or going offline and returning at a dynamically determined future time. The best-known example is the FASTPASS® system at Disneyland. To operate such a system, the service provider must make an upfront decision on how to allocate service capacity between the two lines. Then, during system operation, he must provide estim...

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH-distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first-come-first-served (FCFS) and last-come-first-served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basi...

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...