Improved heuristic for two-machine flowshop scheduling with an availability constraint

Edwin Tai Chiu Cheng; Guoqing Wang

doi:10.1016/S0167-6377(00)00033-X

Improved heuristic for two-machine flowshop scheduling with an availability constraint

Edwin Tai Chiu Cheng
, Guoqing Wang

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

70 Citations (Scopus)

Abstract

In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.

Original language	English
Pages (from-to)	223-229
Number of pages	7
Journal	Operations Research Letters
Volume	26
Issue number	5
DOIs	https://doi.org/10.1016/S0167-6377(00)00033-X
Publication status	Published - 1 Jan 2000

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

More information

10.1016/S0167-6377(00)00033-X

Cite this

@article{471f092509a443deb47ac6322f5f331d,

title = "Improved heuristic for two-machine flowshop scheduling with an availability constraint",

abstract = "In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.",

author = "Cheng, \{Edwin Tai Chiu\} and Guoqing Wang",

year = "2000",

month = jan,

day = "1",

doi = "10.1016/S0167-6377(00)00033-X",

language = "English",

volume = "26",

pages = "223--229",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Improved heuristic for two-machine flowshop scheduling with an availability constraint

AU - Cheng, Edwin Tai Chiu

AU - Wang, Guoqing

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.

AB - In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.

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

U2 - 10.1016/S0167-6377(00)00033-X

DO - 10.1016/S0167-6377(00)00033-X

M3 - Journal article

SN - 0167-6377

VL - 26

SP - 223

EP - 229

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Improved heuristic for two-machine flowshop scheduling with an availability constraint

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this