Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/652
Title: Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Authors: Wang, X
Cheng, TCE 
Keywords: Flowshop scheduling
Heuristics
Error bound
Issue Date: Jan-2007
Publisher: Pergamon Press
Source: Computers and operations research, Jan. 2007, v. 34, no. 1, p. 152-162 How to cite?
Journal: Computers and operations research 
Abstract: This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than ⅔.
URI: http://hdl.handle.net/10397/652
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2005.05.003
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 
Heuristics.pdfPre-published version149.89 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Jul 10, 2018

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Jul 10, 2018

Page view(s)

427
Last Week
0
Last month
Citations as of Jul 10, 2018

Download(s)

412
Citations as of Jul 10, 2018

Google ScholarTM

Check

Altmetric


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