Approximation results for flow shop scheduling problems with machine availability constraints

Authors:
Mikhail A. Kubzin;Chris N. Potts;Vitaly A. Strusevich
Affiliations:
Bear Stearns, One Canada Square, London E14 5AD, UK;Faculty of Mathematical Studies, University of Southampton, Southampton SO17 1BJ, UK;School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 4

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
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

Computers and Operations Research
Speeding-up linear programming using fast matrix multiplication

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
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

Exponential inapproximability and FPTAS for scheduling with availability constraints

Theoretical Computer Science
Makespan Minimization with Machine Availability Constraints

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Approximation schemes for scheduling with availability constraints

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics

Quantified Score

Hi-index	0.01

Visualization

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.