Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

Guoqing Wang; Edwin Tai Chiu Cheng

doi:10.1016/S0020-0190(01)00181-8

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

Guoqing Wang, Edwin Tai Chiu Cheng

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

25 Citations (Scopus)

Abstract

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a worst-case error bound of 5 /3.

Original language	English
Article number	2544
Pages (from-to)	305-309
Number of pages	5
Journal	Information Processing Letters
Volume	80
Issue number	6
DOIs	https://doi.org/10.1016/S0020-0190(01)00181-8
Publication status	Published - 1 Jan 2001

Keywords

Approximation algorithms
Scheduling

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

More information

10.1016/S0020-0190(01)00181-8

Cite this

@article{438aebfe59c4467c9cdb6e1927fbba0c,

title = "Heuristics for two-machine no-wait flowshop scheduling with an availability constraint",

abstract = "In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a worst-case error bound of 5 /3.",

keywords = "Approximation algorithms, Scheduling",

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

year = "2001",

month = jan,

day = "1",

doi = "10.1016/S0020-0190(01)00181-8",

language = "English",

volume = "80",

pages = "305--309",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

AU - Wang, Guoqing

AU - Cheng, Edwin Tai Chiu

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a worst-case error bound of 5 /3.

AB - In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a worst-case error bound of 5 /3.

KW - Approximation algorithms

KW - Scheduling

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

U2 - 10.1016/S0020-0190(01)00181-8

DO - 10.1016/S0020-0190(01)00181-8

M3 - Journal article

SN - 0020-0190

VL - 80

SP - 305

EP - 309

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

M1 - 2544

ER -

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this