A preemptive open shop scheduling problem with one resource

Authors:
D. De Werra;J. Baewicz;W. Kubiak
Affiliations:
Département de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Instytut Informatyki i Robotyki, Politechnika Poznaska, Poznan, Poland;Faculty of Management, University of Toronto, Toronto, Canada
Venue:
Operations Research Letters
Year:
1991

Citing 1
Cited 1

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)

Minimizing the total completion time in a unit-time open shop with release times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model for a preemptive open shop scheduling problem is presented and constraints due to the availability of a nonrenewable resource are introduced. NP-completeness of the general case is shown. Some solvable cases are discussed.