The Community for Technology Leaders
RSS Icon
Issue No.10 - October (1979 vol.28)
pp: 782-786
T. Gonzalez , Department of Computer Science, Institute of Technology
The problem of preemptively scheduling a set of n independent jobs on an m processor open shop is discussed. An algorithm to construct preemptive schedules with minimum-maximum finishing time is presented. The worst case time complexity is 0(r + min {m<sup>4</sup>, n<sup>4</sup>, r<sup>2</sup>}), where r is the number of nonzero tasks. The maximum number of preemptions introduced is 0(min {rn, rm,
preemptive scheduling, Finish time, open shops, polynomial complexity
T. Gonzalez, "A Note on Open Shop Preemptive Schedules", IEEE Transactions on Computers, vol.28, no. 10, pp. 782-786, October 1979, doi:10.1109/TC.1979.1675246
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool