We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...

queueing models with impatient customers, server vacations and a waiting server. The arrival process is assumed to be Poisson. The server is allowed to take a vacation whenever the system is empty after waiting for a random period of time. Whenever the server is on vacation, each customer in the queue independently of the other customers sets up an impatience timer. If the server does not retur...

Switching between electronic and traditional markets, consumers nowadays impact profoundly on market makers. To successful conduct business, firms have to carefully making channel decisions to meet the needs of customers. The purpose of this article is to offer normative models for analyzing consumer channel selection behaviors between traditional and electronic markets. Referred to transaction...

In order to deliver assured Quality of Service (QoS) to the customer in terms of minimizing the expected waiting time in the queue; the service providers are putting a lot of effort. The varying calling pattern of the customers during different times of the day poses many challenging problems in terms of allocating the number of employees in an efficient manner to handle the customer’s calls. T...

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.

abstract introduction: the amount of waiting time is an indicator of level of access to hospital services and can be measured as one of the indicators of the effectiveness of hospital performance. this study aimed to determine the average waiting time in shahid rahnamoon and afshar clinics. methods: this descriptive, analytical, cross – sectional study was conducted with a simple size of 264 pa...

T he existing queueing literature typically assumes that customers either perfectly know the expected waiting time or are able to form rational expectations about it. In contrast, in this article, we study canonical service models where customers do not have such full information or capability. We assume that customers lack full capability or ample opportunities to perfectly infer the service r...

We consider how to partition arriving customers into service groups that will be served separately , in a rst-come rst-served manner, by multi-server service systems having a provision for waiting, and how to assign an appropriate number of servers to each group. We assume that customers can be classiied upon arrival, possibly according to their service requirements. We model the congestion exp...

For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.