Two-machine open shop scheduling with an availability constraint

Authors:
Joachim Breit;GüNter Schmidt;Vitaly A. Strusevich
Affiliations:
Department of Information and Technology Management, Saarland University, D-66041 Saarbrücken, Germany;Institut für Informatik, Technische Universität Clausthal, Julius Albert Str. 4, 38678 Clausthal-Zellerfeld, Germany;School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK
Venue:
Operations Research Letters
Year:
2001

Citing 5
Cited 2

An NP-hard open shop scheduling problem with polynomial average time complexity

Mathematics of Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Scheduling two-stage hybrid flow shop with availability constraints

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

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 43.