Minimization of job waiting time variance on identical parallel machines

Xiaoyun Xu, Nong Ye

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (Pm WTV). We show that the optimal value of Pm WTV is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines (Pm CTV). We prove that, given the same job set, any feasible schedule of Pm WTV can be transformed into the feasible solution for Pm CTV with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of Pm WTV are also proved. Heuristic algorithms are proposed to solve Pm WTV problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.

Original languageEnglish (US)
Pages (from-to)917-927
Number of pages11
JournalIEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews
Volume37
Issue number5
DOIs
StatePublished - Sep 2007

Fingerprint

Heuristic algorithms
Scheduling
Polynomials
Testing

Keywords

  • Identical parallel machine
  • Job scheduling
  • Waiting time variance (WTV)

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Artificial Intelligence
  • Human-Computer Interaction
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Minimization of job waiting time variance on identical parallel machines. / Xu, Xiaoyun; Ye, Nong.

In: IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, Vol. 37, No. 5, 09.2007, p. 917-927.

Research output: Contribution to journalArticle

@article{d4a7f308b05c4a4b897e224586d0409a,
title = "Minimization of job waiting time variance on identical parallel machines",
abstract = "We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (Pm WTV). We show that the optimal value of Pm WTV is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines (Pm CTV). We prove that, given the same job set, any feasible schedule of Pm WTV can be transformed into the feasible solution for Pm CTV with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of Pm WTV are also proved. Heuristic algorithms are proposed to solve Pm WTV problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.",
keywords = "Identical parallel machine, Job scheduling, Waiting time variance (WTV)",
author = "Xiaoyun Xu and Nong Ye",
year = "2007",
month = "9",
doi = "10.1109/TSMCC.2007.900657",
language = "English (US)",
volume = "37",
pages = "917--927",
journal = "IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews",
issn = "1094-6977",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Minimization of job waiting time variance on identical parallel machines

AU - Xu, Xiaoyun

AU - Ye, Nong

PY - 2007/9

Y1 - 2007/9

N2 - We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (Pm WTV). We show that the optimal value of Pm WTV is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines (Pm CTV). We prove that, given the same job set, any feasible schedule of Pm WTV can be transformed into the feasible solution for Pm CTV with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of Pm WTV are also proved. Heuristic algorithms are proposed to solve Pm WTV problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.

AB - We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (Pm WTV). We show that the optimal value of Pm WTV is identical to the optimal value of the problem for minimizing the completion time variance of jobs on identical parallel machines (Pm CTV). We prove that, given the same job set, any feasible schedule of Pm WTV can be transformed into the feasible solution for Pm CTV with the same job set by applying the polynomial algorithms proposed in this paper. Several other important properties of Pm WTV are also proved. Heuristic algorithms are proposed to solve Pm WTV problems. We present the testing results of these heuristic algorithms, which are applied to problems with both small and large job sets.

KW - Identical parallel machine

KW - Job scheduling

KW - Waiting time variance (WTV)

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

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

U2 - 10.1109/TSMCC.2007.900657

DO - 10.1109/TSMCC.2007.900657

M3 - Article

AN - SCOPUS:34548238766

VL - 37

SP - 917

EP - 927

JO - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

JF - IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

SN - 1094-6977

IS - 5

ER -