Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474811 | Computers & Operations Research | 2009 | 12 Pages |
Abstract
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenario in which some portion of the processing is repeated but the job is otherwise resumable. For the problem with several non-availability intervals on the first machine under the resumable scenario, we present a fast (32)-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich,