Beyond Smith's Rule: An Optimal Dynamic Index, Rule For Single Machine Stochastic Scheduling With Convex Holding Costs
نویسندگان
چکیده
منابع مشابه
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...
متن کاملLower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed that scheduling the jobs according to the WSPT rule –also known as Smith’s rule– has a performance guarantee of 1 2 (1 + √ 2) ≈ 1.207. They also gave an instance to show that this bound is tight. We consider the stoch...
متن کاملA New Dispatching Rule for the Stochastic Single-Machine Scheduling Problem
In this article, the authors consider the n-job single-machine scheduling problem in which jobs with stochastic processing time requirements arrive to the system at random times. The performance measure combines both mean and variance of job completion times. In this study, a dispatching rule is designed to minimize the performance measure using a simulation model built using AWESIM. Different ...
متن کاملAnalysis of Smith's rule in stochastic machine scheduling
In a landmark paper from 1986, Kawaguchi and Kyan show that scheduling jobs according to ratios weight over processing time –also known as Smith’s rule– has a tight performance guarantee of (1 + √ 2)/2 ≈ 1.207 for minimizing the weighted sum of completion times in parallel machine scheduling. We prove the counterintuitive result that the performance guarantee of Smith’s rule is not better than ...
متن کاملBEYOND THE c RULE : DYNAMIC SCHEDULING OFA TWO - CLASS LOSS
We consider scheduling a single server in a two-class M/M/1 queueing system with nite buuers subject to holding costs and rejection costs for rejected jobs. We use dynamic programming to investigate the structural properties of optimal policies. Provided that the delay of serving a job is always less costly than rejecting an arrival, we show that the optimal policy has a monotonic threshold typ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2001
ISSN: 1556-5068
DOI: 10.2139/ssrn.273398