A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

0.00 Avg rating—0 Votes
Article ID: iaor20071734
Country: United Kingdom
Volume: 33
Issue: 8
Start Page Number: 2143
End Page Number: 2153
Publication Date: Aug 2006
Journal: Computers and Operations Research
Authors:
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.