|
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/1081
|
| Title: | An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint |
| Authors: | Wang, Xiuli
Cheng, T. C. Edwin |
| Subjects: | Flowshop scheduling
Approximation scheme
Availability constraint |
| Issue Date: | Oct-2007 |
| Publisher: | Elsevier |
| Citation: | Computers & operations research, Oct. 2007, v. 34, no. 10, p. 2894-2901. |
| Abstract: | This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem. |
| Description: | DOI: 10.1016/j.cor.2005.11.019 |
| Rights: | Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. |
| Type: | Journal/Magazine Article |
| URI: | http://hdl.handle.net/10397/1081 |
| ISSN: | 0305-0548 |
| 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.
|
|
