Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10269
Title: Improved heuristic for two-machine flowshop scheduling with an availability constraint
Authors: Cheng, TCE 
Wang, G
Issue Date: 2000
Publisher: North-Holland
Source: Operations research letters, 2000, v. 26, no. 5, p. 223-229 How to cite?
Journal: Operations research letters 
Abstract: In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.
URI: http://hdl.handle.net/10397/10269
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/S0167-6377(00)00033-X
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

61
Last Week
0
Last month
1
Citations as of Dec 8, 2018

WEB OF SCIENCETM
Citations

52
Last Week
1
Last month
0
Citations as of Dec 8, 2018

Page view(s)

73
Last Week
2
Last month
Citations as of Dec 10, 2018

Google ScholarTM

Check

Altmetric


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