A linear time approximation scheme for makespan minimization in an open shop with release dates

Authors:
Alexander Kononov;Maxim Sviridenko
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia and Simon Fraser University, Burnaby, BC, Canada;Sobolev Institute of Mathematics, Novosibirsk, Russia and IBM T. J. Watson Research Center, NY, USA
Venue:
Operations Research Letters
Year:
2002

Citing 5
Cited 0

Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Near-Optimal Sequencing with Precedence Constraints

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Approximation algorithms for the multiprocessor open shop scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we demonstrate the existence of a linear time approximation scheme for makespan minimization in the multiprocessor open shop problem with release dates. Our approximation scheme is linear and does not require solving linear program.