Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13335
Title: Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Authors: Wang, G
Cheng, TCE 
Keywords: Approximation algorithms
Scheduling
Issue Date: 2001
Source: Information processing letters, 2001, v. 80, no. 6, p. 305-309 How to cite?
Journal: Information Processing Letters 
Abstract: In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a worst-case error bound of 5 /3.
URI: http://hdl.handle.net/10397/13335
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(01)00181-8
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

20
Last Week
0
Last month
0
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

41
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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