A note on "parallel machine scheduling with non-simultaneous machine available time"

Chung Yee Lee; Yong He; Guochun Tang

doi:10.1016/S0166-218X(99)00201-2

A note on "parallel machine scheduling with non-simultaneous machine available time"

Chung Yee Lee^*, Yong He, Guochun Tang

^*Corresponding author for this work

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

32 Citations (Scopus)

Abstract

The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying the Longest Processing Time (LPT) algorithm to the problem can be tightened if the number of active machines is smaller than the total number of machines.

Original language	English
Pages (from-to)	133-135
Number of pages	3
Journal	Discrete Applied Mathematics
Volume	100
Issue number	1-2
DOIs	https://doi.org/10.1016/S0166-218X(99)00201-2
Publication status	Published - 15 Mar 2000
Externally published	Yes

Keywords

Error-bound analysis
Machine availability constraint
Parallel machine scheduling

Access to Document

10.1016/S0166-218X(99)00201-2

Cite this

@article{6035aa5465ef4908aa876517a282ceef,

title = "A note on {"}parallel machine scheduling with non-simultaneous machine available time{"}",

abstract = "The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying the Longest Processing Time (LPT) algorithm to the problem can be tightened if the number of active machines is smaller than the total number of machines.",

keywords = "Error-bound analysis, Machine availability constraint, Parallel machine scheduling",

author = "Lee, \{Chung Yee\} and Yong He and Guochun Tang",

year = "2000",

month = mar,

day = "15",

doi = "10.1016/S0166-218X(99)00201-2",

language = "English",

volume = "100",

pages = "133--135",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - A note on "parallel machine scheduling with non-simultaneous machine available time"

AU - Lee, Chung Yee

AU - He, Yong

AU - Tang, Guochun

PY - 2000/3/15

Y1 - 2000/3/15

N2 - The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying the Longest Processing Time (LPT) algorithm to the problem can be tightened if the number of active machines is smaller than the total number of machines.

AB - The purpose of this note is to point out that if there are some machines that do not process any job and hence is inactive in the planning horizon then the lower bound of makespan provided by Lee (1991) in the above mentioned paper may not be a valid one. Furthermore, the error bound of applying the Longest Processing Time (LPT) algorithm to the problem can be tightened if the number of active machines is smaller than the total number of machines.

KW - Error-bound analysis

KW - Machine availability constraint

KW - Parallel machine scheduling

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000084804600010

UR - https://openalex.org/W1991593924

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

U2 - 10.1016/S0166-218X(99)00201-2

DO - 10.1016/S0166-218X(99)00201-2

M3 - Journal Article

SN - 0166-218X

VL - 100

SP - 133

EP - 135

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -

A note on "parallel machine scheduling with non-simultaneous machine available time"

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this