Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1081
Title: An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
Authors: Wang, X
Cheng, TCE 
Keywords: Flowshop scheduling
Approximation scheme
Availability constraint
Issue Date: Oct-2007
Publisher: Pergamon Press
Source: Computers and operations research, Oct. 2007, v. 34, no. 10, p. 2894-2901 How to cite?
Journal: Computers and operations research 
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.
URI: http://hdl.handle.net/10397/1081
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2005.11.019
Rights: Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
A PTAS for Twomachine Flowshop Scheduling v4.pdfPre-published version178.83 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Aug 21, 2017

Page view(s)

461
Last Week
0
Last month
Checked on Aug 20, 2017

Download(s)

649
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.