An optimal algorithm for a class of tardiness scheduling problem

Si Jie Jiang; Xiao Fei Xu

An optimal algorithm for a class of tardiness scheduling problem

Si Jie Jiang^*
, Xiao Fei Xu

^*Corresponding author for this work

Faculty of Computing

Harbin Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Scheduling n independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m -P-S-K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.

Original language	English
Pages (from-to)	62-64
Number of pages	3
Journal	Journal of Harbin Institute of Technology (New Series)
Volume	7
Issue number	2
State	Published - Jun 2000

Keywords

Generic algorithm
Heuristics
Nonpreemptively scheduling

Cite this

@article{3e734d5c1d1d4b7dad18997a47d38ebf,

title = "An optimal algorithm for a class of tardiness scheduling problem",

abstract = "Scheduling n independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m -P-S-K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.",

keywords = "Generic algorithm, Heuristics, Nonpreemptively scheduling",

author = "Jiang, \{Si Jie\} and Xu, \{Xiao Fei\}",

year = "2000",

month = jun,

language = "英语",

volume = "7",

pages = "62--64",

journal = "Journal of Harbin Institute of Technology (New Series)",

issn = "1005-9113",

publisher = "Harbin Institute of Technology",

number = "2",

}

TY - JOUR

T1 - An optimal algorithm for a class of tardiness scheduling problem

AU - Jiang, Si Jie

AU - Xu, Xiao Fei

PY - 2000/6

Y1 - 2000/6

N2 - Scheduling n independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m -P-S-K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.

AB - Scheduling n independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m -P-S-K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.

KW - Generic algorithm

KW - Heuristics

KW - Nonpreemptively scheduling

UR - https://www.scopus.com/pages/publications/77949966442

M3 - 文章

AN - SCOPUS:77949966442

SN - 1005-9113

VL - 7

SP - 62

EP - 64

JO - Journal of Harbin Institute of Technology (New Series)

JF - Journal of Harbin Institute of Technology (New Series)

IS - 2

ER -

An optimal algorithm for a class of tardiness scheduling problem

Abstract

Keywords

Other files and links

Fingerprint

Cite this