Efficient implementation of Johnson's rule for the n/2/F/Fmaxscheduling problem

Edwin Tai Chiu Cheng

doi:10.1016/0360-8352(92)90024-E

Efficient implementation of Johnson's rule for the n/2/F/F_maxscheduling problem

Edwin Tai Chiu Cheng

Research output: Journal article publication › Journal article › Academic research › peer-review

4 Citations (Scopus)

Abstract

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.

Original language	English
Pages (from-to)	495-499
Number of pages	5
Journal	Computers and Industrial Engineering
Volume	22
Issue number	4
DOIs	https://doi.org/10.1016/0360-8352(92)90024-E
Publication status	Published - 1 Jan 1992
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/0360-8352(92)90024-E

Cite this

@article{790b311fba0d466ba05ade1b50835093,

title = "Efficient implementation of Johnson's rule for the n/2/F/Fmaxscheduling problem",

abstract = "Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.",

author = "Cheng, {Edwin Tai Chiu}",

year = "1992",

month = jan,

day = "1",

doi = "10.1016/0360-8352(92)90024-E",

language = "English",

volume = "22",

pages = "495--499",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

number = "4",

}

TY - JOUR

T1 - Efficient implementation of Johnson's rule for the n/2/F/Fmaxscheduling problem

AU - Cheng, Edwin Tai Chiu

PY - 1992/1/1

Y1 - 1992/1/1

N2 - Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.

AB - Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.

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

U2 - 10.1016/0360-8352(92)90024-E

DO - 10.1016/0360-8352(92)90024-E

M3 - Journal article

SN - 0360-8352

VL - 22

SP - 495

EP - 499

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 4

ER -

Efficient implementation of Johnson's rule for the n/2/F/F_maxscheduling problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this