Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems
نویسندگان
چکیده
I a recent paper we introduced the queue-and-idleness ratio (QIR) family of routing rules for many-server service systems with multiple customer classes and server pools. A newly available server serves the customer from the head of the queue of the class (from among those the server is eligible to serve) whose queue length most exceeds a specified proportion of the total queue length. Under fairly general conditions, QIR produces an important state-space collapse as the total arrival rate and the numbers of servers increase in a coordinated way. That state-space collapse was previously used to delicately balance service levels for the different customer classes. In this sequel, we show that a special version of QIR stochastically minimizes convex holding costs in a finite-horizon setting when the service rates are restricted to be pool dependent. Under additional regularity conditions, the special version of QIR reduces to a simple policy: linear costs produce a priority-type rule, in which the least-cost customers are given low priority. Strictly convex costs (plus other regularity conditions) produce a many-server analogue of the generalized-c (Gc ) rule, under which a newly available server selects a customer from the class experiencing the greatest marginal cost at that time.
منابع مشابه
Online companion for Scheduling Flexible Servers with Convex Delay Costs In Many-Server Service Systems
متن کامل
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule
We consider a queueing system with multitype customers and flexible (multiskilled) servers that work in parallel. If Qi is the queue length of type i customers, this queue incurs cost at the rate of Ci Qi , where Ci · is increasing and convex. We analyze the system in heavy traffic (Harrison and Lopez 1999) and show that a very simple generalized c -rule (Van Mieghem 1995) minimizes both instan...
متن کاملDynamic Scheduling with Convex Delay Costs: The Generalized c Rule
We consider a general single-server multiclass queueing system that incurs a delay cost Ck( k) for each class k job that resides k units of time in the system. This paper derives a scheduling policy that minimizes the total cumulative delay cost when the system operates during a nite time horizon. Denote the marginal delay cost and (instantaneous) service rate functions of class k by ck = C 0 k...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملA multi-objective mathematical model for production-distribution scheduling problem
With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Manufacturing & Service Operations Management
دوره 11 شماره
صفحات -
تاریخ انتشار 2009