Scheduling open shops with parallel machines

Authors:
E. L. Lawler;M. G. Luby;V. V. Vazirani
Affiliations:
Computer Science Division, University of California, Berkeley, CA 94720, U.S.A.;Computer Science Division, University of California, Berkeley, CA 94720, U.S.A.;Computer Science Division, University of California, Berkeley, CA 94720, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 2
Cited 3

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)

A genetic algorithm for the proportionate multiprocessor open shop

Computers and Operations Research
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

Operations Research Letters
Approximation algorithms for the multiprocessor open shop scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The parallel shop and the open shop are two machine environments that have received much attention in the literature of scheduling theory. A common generalization-the open shop with parallel machines-is considered in this paper. Polynomial-time algorithms are presented for obtaining minimum-length preemptive schedules for three cases. Open shops with single-operation machines of equal speed are scheduled with essentially no more difficulty than an ordinary open shop. Open shops with multiple-operation machines of equal speed are scheduled with the aid of a sequence of network flow computations. The general open shop problem with parallel machines of arbitrary speeds can be solved by linear programming, in much the same way as an optimal preemptive schedule can be found for unrelated parallel machines.