Approximability of two-machine no-wait flowshop scheduling with availability constraints

Edwin Tai Chiu Cheng; Zhaohui Liu

doi:10.1016/S0167-6377(02)00230-4

Approximability of two-machine no-wait flowshop scheduling with availability constraints

Edwin Tai Chiu Cheng, Zhaohui Liu

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

35 Citations (Scopus)

Abstract

The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.

Original language	English
Pages (from-to)	319-322
Number of pages	4
Journal	Operations Research Letters
Volume	31
Issue number	4
DOIs	https://doi.org/10.1016/S0167-6377(02)00230-4
Publication status	Published - 1 Jul 2003

Keywords

Approximation scheme
Scheduling

ASJC Scopus subject areas

Management Science and Operations Research
Statistics, Probability and Uncertainty
Discrete Mathematics and Combinatorics
Modelling and Simulation

More information

10.1016/S0167-6377(02)00230-4

http://hdl.handle.net/10397/481

Cite this

@article{4c8274f453314726a5ba812ccd10303c,

title = "Approximability of two-machine no-wait flowshop scheduling with availability constraints",

abstract = "The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.",

keywords = "Approximation scheme, Scheduling",

author = "Cheng, {Edwin Tai Chiu} and Zhaohui Liu",

year = "2003",

month = jul,

day = "1",

doi = "10.1016/S0167-6377(02)00230-4",

language = "English",

volume = "31",

pages = "319--322",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Approximability of two-machine no-wait flowshop scheduling with availability constraints

AU - Cheng, Edwin Tai Chiu

AU - Liu, Zhaohui

PY - 2003/7/1

Y1 - 2003/7/1

N2 - The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.

AB - The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.

KW - Approximation scheme

KW - Scheduling

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

U2 - 10.1016/S0167-6377(02)00230-4

DO - 10.1016/S0167-6377(02)00230-4

M3 - Journal article

SN - 0167-6377

VL - 31

SP - 319

EP - 322

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

Approximability of two-machine no-wait flowshop scheduling with availability constraints

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this