How many servers are best in a dual-priority M/PH/k system?
نویسندگان
چکیده
We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?” Our setting is the M/PH/k system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the service demand variability of high priority jobs on low priority jobs.
منابع مشابه
How many servers are best in a dual-priority FCFS system?
We ask the question, "for minimizing mean response time, which is preferable: one fast server of speed 1, or A; slow servers each of speed I/A:?" Our setting is the M/Gl/k system with two priority classes of customers, high priority and low priority, where G is a phase-type distribution. We find that multiple slow servers are often preferable — and we demonstrate exactly how many servers are pr...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملImpact of Transportation System on Total Cost in a Two-Echelon Dual Channel Supply Chain
The advent of e-commerce has prompted many manufacturers to redesign their traditionalchannel structure by engaging in direct sales. In this paper, we present a dual channel inventory modelbased on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retailchannel and a direct channel which stocks are kept in both upper and lower echelon. The systemreceives stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 63 شماره
صفحات -
تاریخ انتشار 2006