Title of article
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
Author/Authors
Joachim Breit، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2006
Pages
11
From page
2143
To page
2153
Abstract
We study the problem of scheduling n preemptable jobs in a two-machine flow shop where the first machine is not available for processing during a given time interval. The objective is to minimize the makespan. We propose a polynomial-time approximation scheme for this problem. The approach is extended to solve the problem in which the second machine is not continuously available.
Keywords
Approximation algorithms , Flow shop scheduling , Availability constraints
Journal title
Computers and Operations Research
Serial Year
2006
Journal title
Computers and Operations Research
Record number
928756
Link To Document