Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34172
Title: Two-machine flowshop scheduling with consecutive availability constraints
Authors: Cheng, TCE 
Wang, G
Keywords: Algorithms
Flowshop scheduling
Worst-case analysis
Issue Date: 1999
Source: Information processing letters, 1999, v. 71, no. 2, p. 49-54 How to cite?
Journal: Information Processing Letters 
Abstract: In this paper we study a special case of the two-machine flowshop problem with an availability constraint imposed on each machine. The two availability constraints are consecutive. We establish some basic properties for the semiresumable case, i.e. if a job cannot be finished before the next down period of a machine, then the job will be partially restarted when the machine becomes available again. We provide a heuristic for the problem and show that it has a worst-case error bound of 2/3 for the nonresumable case.
URI: http://hdl.handle.net/10397/34172
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(99)00094-0
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

25
Last Week
0
Last month
0
Citations as of Sep 24, 2017

WEB OF SCIENCETM
Citations

25
Last Week
0
Last month
0
Citations as of Sep 22, 2017

Page view(s)

55
Last Week
1
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



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