On the complexity of preemptive open-shop scheduling problems

Authors:
C.Y Liu;R.L Bulfin
Affiliations:
Department of Business Administration, National Sun Yat - Sen University, Kao Hsiung, Taiwan, ROC;Department of Industrial Engineering, Auburn University, AL 36849, USA
Venue:
Operations Research Letters
Year:
1985

Citing 2
Cited 1

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
A Note on Open Shop Preemptive Schedules

IEEE Transactions on Computers

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of preemptively scheduling a set of n independent jobs on an m-machine open shop is studied, and two results are obtained. The first indicates that constructing optimal flow-time schedules is NP-hard for m larger than two. The second result shows that the problem remains NP-hard for the two-processor case when all jobs must be completed by their respective deadlines.