Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/481
| Title: | Approximability of two-machine no-wait flowshop scheduling with availability constraints | Authors: | Cheng, TCE Liu, Z |
Issue Date: | Jul-2003 | Source: | Operations research letters, July 2003, v. 31, no. 4, p. 319-322 | Abstract: | We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. | Keywords: | Scheduling Approximation scheme |
Publisher: | Elsevier | Journal: | Operations research letters | ISSN: | 0167-6377 | EISSN: | 1872-7468 | DOI: | 10.1016/S0167-6377(02)00230-4 | Rights: | Operations Research Letters © 2003 Elsevier Science. 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 | |
|---|---|---|---|---|
| Approximability No-wait.pdf | Pre-published version | 95.02 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
192
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
208
Citations as of Apr 21, 2024
SCOPUSTM
Citations
35
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
30
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.