Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/652
PIRA download icon_1.1View/Download Full Text
Title: Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Authors: Wang, X
Cheng, TCE 
Issue Date: Jan-2007
Source: Computers and operations research, Jan. 2007, v. 34, no. 1, p. 152-162
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 ⅔.
Keywords: Flowshop scheduling
Heuristics
Error bound
Publisher: Pergamon Press
Journal: Computers and operations research 
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
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

97
Last Week
0
Last month
Citations as of May 22, 2022

Downloads

131
Citations as of May 22, 2022

SCOPUSTM   
Citations

18
Last Week
0
Last month
0
Citations as of May 12, 2022

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of May 19, 2022

Google ScholarTM

Check

Altmetric


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