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, TCE Liu, Z |
Issue Date: | 30-Nov-2003 | 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. | Keywords: | Scheduling Approximation algorithms |
Publisher: | Elsevier | Journal: | Information processing letters | ISSN: | 0020-0190 | DOI: | 10.1016/j.ipl.2003.08.002 | Rights: | Information Processing Letters © 2003 Elsevier. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nowait_v2.pdf | Pre-published version | 102.73 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
160
Last Week
0
0
Last month
Citations as of May 5, 2024
Downloads
199
Citations as of May 5, 2024
SCOPUSTM
Citations
16
Last Week
0
0
Last month
0
0
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
14
Last Week
0
0
Last month
0
0
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.