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

Authors:
J. Breit
Affiliations:
Department of Information and Technology Management, Saarland University, Saarbrücken, Germany
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 8

Two-machine flowshop scheduling with consecutive availability constraints

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

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

Computers and Operations Research
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Computers and Operations Research
Approximation results for flow shop scheduling problems with machine availability constraints

Computers and Operations Research
Heuristic algorithms for two-machine flowshop with availability constraints

Computers and Industrial Engineering
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Computers and Operations Research
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

Computers and Industrial Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e., if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this problem guarantees a relative worst-case error bound of 4/3. We present an improved algorithm with a relative worst-case error bound of 5/4.