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

Authors:
Joachim Breit
Affiliations:
Department of Information and Technology Management, Saarland University, Saarbrücken, Germany
Venue:
Computers and Operations Research
Year:
2006

Citing 4
Cited 6

Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

Information Processing Letters
An improved heuristic for two-machine flowshop scheduling with an availability constraint

Operations Research Letters
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Approximation results for flow shop scheduling problems with machine availability constraints

Computers and Operations Research
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Computers and Operations Research
A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time

Computers and Industrial Engineering
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
An effective heuristic for flexible job-shop scheduling problem with maintenance activities

Computers and Industrial Engineering
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

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.