|
PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >
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, T. C. Edwin
Liu, Zhaohui |
| Subjects: | Scheduling
Approximation scheme |
| Issue Date: | Jul-2003 |
| Publisher: | Elsevier |
| Citation: | 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. |
| Description: | 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. |
| Type: | Journal/Magazine Article |
| URI: | http://hdl.handle.net/10397/481 |
| ISSN: | 01676377 |
| Appears in Collections: | LMS Journal/Magazine Articles
|
Locate publisher version via 
|
 Facebook
 del.icio.us
 LinkedIn
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.
|
|
