Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/473
Title: [3/2]-approximation for two-machine no-wait flowshop scheduling with availability constraints
Authors: Cheng, T. C. Edwin
Liu, Zhaohui
Subjects: Scheduling
Approximation algorithms
Issue Date: 30-Nov-2003
Publisher: Elsevier
Source: Information processing letters, Nov. 2003, v. 88, no. 4, p. 161-165.
Abstract: We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present [3/2]-approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results.
Rights: Information Processing Letters © 2003 Elsevier. The journal web site is located at http://www.sciencedirect.com.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/473
DOI: 10.1016/j.ipl.2003.08.002
ISSN: 0020-0190
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
nowait_v2.pdfPre-published version102.73 kBAdobe PDFView/Open


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.