An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Xiuli Wang; Edwin Tai Chiu Cheng

doi:10.1016/j.cor.2005.11.019

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Xiuli Wang, Edwin Tai Chiu Cheng

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

14 Citations (Scopus)

Abstract

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.

Original language	English
Pages (from-to)	2894-2901
Number of pages	8
Journal	Computers and Operations Research
Volume	34
Issue number	10
DOIs	https://doi.org/10.1016/j.cor.2005.11.019
Publication status	Published - 1 Oct 2007

Keywords

Approximation scheme
Availability constraint
Flowshop scheduling

ASJC Scopus subject areas

Information Systems and Management
Management Science and Operations Research
Applied Mathematics
Modelling and Simulation
Transportation

More information

10.1016/j.cor.2005.11.019

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

Cite this

@article{657c6eff1f074b1abd620578fa5f1128,

title = "An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint",

abstract = "This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.",

keywords = "Approximation scheme, Availability constraint, Flowshop scheduling",

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

year = "2007",

month = oct,

day = "1",

doi = "10.1016/j.cor.2005.11.019",

language = "English",

volume = "34",

pages = "2894--2901",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "10",

}

TY - JOUR

T1 - An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

AU - Wang, Xiuli

AU - Cheng, Edwin Tai Chiu

PY - 2007/10/1

Y1 - 2007/10/1

N2 - This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.

AB - This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.

KW - Approximation scheme

KW - Availability constraint

KW - Flowshop scheduling

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

U2 - 10.1016/j.cor.2005.11.019

DO - 10.1016/j.cor.2005.11.019

M3 - Journal article

SN - 0305-0548

VL - 34

SP - 2894

EP - 2901

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 10

ER -

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this