Key points are not available for this paper at this time.
A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial time algorithm to obtain a minimum finish time preemptive schedule for open shops with more than two processors are obtained. It is also shown that the problem of obtaining minimum finish time nonpreemptive schedules when the open shop has more than two processors is NP-complete.
Building similarity graph...
Analyzing shared references across papers
Loading...
Journal of the ACM
University of Minnesota
Pennsylvania State University
Add This Paper to Your Research Feed
Any time a new paper drops it will be there.
Gonzalez et al. (Fri,) studied this question.