Job scheduling methods for reducing waiting time variance

Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

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-hard, 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.

Original languageEnglish (US)
Pages (from-to)3069-3083
Number of pages15
JournalComputers and Operations Research
Volume34
Issue number10
DOIs
StatePublished - Oct 2007

Fingerprint

Job Scheduling
Waiting Time
scheduling
Scheduling
Scheduling Problem
Network performance
Computer networks
Computational complexity
performance
Quality of service
time
Waiting time
Computer Networks
Network Performance
Minimization Problem
Batch
Quality of Service
Computational Cost
heuristics
Schedule

Keywords

  • Computer networks
  • Job scheduling
  • Quality of Service (QoS)
  • Waiting time variance

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Job scheduling methods for reducing waiting time variance. / Ye, Nong; Li, Xueping; Farley, Toni; Xu, Xiaoyun.

In: Computers and Operations Research, Vol. 34, No. 10, 10.2007, p. 3069-3083.

Research output: Contribution to journalArticle

Ye, Nong ; Li, Xueping ; Farley, Toni ; Xu, Xiaoyun. / Job scheduling methods for reducing waiting time variance. In: Computers and Operations Research. 2007 ; Vol. 34, No. 10. pp. 3069-3083.
@article{4dc771b15ed04c9996666820a7af9d4d,
title = "Job scheduling methods for reducing waiting time variance",
abstract = "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-hard, 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.",
keywords = "Computer networks, Job scheduling, Quality of Service (QoS), Waiting time variance",
author = "Nong Ye and Xueping Li and Toni Farley and Xiaoyun Xu",
year = "2007",
month = "10",
doi = "10.1016/j.cor.2005.11.015",
language = "English (US)",
volume = "34",
pages = "3069--3083",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "10",

}

TY - JOUR

T1 - Job scheduling methods for reducing waiting time variance

AU - Ye, Nong

AU - Li, Xueping

AU - Farley, Toni

AU - Xu, Xiaoyun

PY - 2007/10

Y1 - 2007/10

N2 - 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-hard, 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.

AB - 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-hard, 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.

KW - Computer networks

KW - Job scheduling

KW - Quality of Service (QoS)

KW - Waiting time variance

UR - http://www.scopus.com/inward/record.url?scp=33847627486&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847627486&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2005.11.015

DO - 10.1016/j.cor.2005.11.015

M3 - Article

VL - 34

SP - 3069

EP - 3083

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 10

ER -