Job scheduling methods for reducing waiting time variance

doi:10.1016/j.cor.2005.11.015

Job scheduling methods for reducing waiting time variance

2007-10-01

22

PRE

AI

DOI：10.1016/j.cor.2005.11.015

Original

Original request for help

Save

Abstract

En 中文

Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. Minimizing WTV is a well known scheduling problem, important in providing Quality of Service (QoS) in many industries. Minimizing the variance of job waiting times on computer networks can lead to stable and predictable network performance. Since the WTV minimization problem is NP-liard, we develop two heuristic job scheduling methods, called Balanced Spiral and Verified Spiral, which incorporate certain proven properties of optimal job sequences for this problem. We test and compare our methods with four other job scheduling methods on both small and large size problem instances. Performance results show that Verified Spiral gives the best performance for the scheduling methods and problems tested in this study. Balanced Spiral produces comparable results, but at less computational cost. During our investigation we discovered a consistent pattern in the plot of WTV over mean of all possible sequences for a set of jobs, which can be used to evaluate the sacrifice of mean waiting time while pursuing WTV minimization. (c) 2005 Elsevier Ltd. All rights reserved.

Keywords:

waiting time variance

job scheduling

Quality of Service (QoS)

computer networks

Job scheduling methods for reducing waiting time variance

Abstract

AI Summary

Journal

Organization