| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 475452 | Computers & Operations Research | 2007 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Xiuli Wang, T.C. Edwin Cheng,