Abstract
We consider the preemptive scheduling of n independent jobs on m unrelated machines to minimize the makespan. Preemptive schedules with at most 2m−3 preemptions are built, which are optimal when the maximal job processing time is no more than the optimal schedule makespan. We further restrict the maximal job processing time and obtain optimal schedules with at most m−1 preemptions. This is better than the earlier known best bound of 4m 2−5m+2 on the total number of preemptions. Without the restriction on the maximal job processing time, our (2m−3)-preemptive schedules have a makespan which is no more than either of the following two magnitudes: (a) the maximum between the longest job processing time and the optimal preemptive makespan, and (b) the optimal nonpreemptive makespan. Our (m−1)-preemptive schedules might be at most twice worse than an optimal one.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Gonzalez, T. and Sahni, S.: Open shop scheduling to minimize finish time, J. ACM 23 (1976), 665–679.
Gonzalez, T. and Sahni, S.: Preemptive scheduling of uniform processor systems, J. ACM 25 (1978), 92–101.
Kunde, M.: Nonpreemptive LP-scheduling on homogeneous multiprocessor system, SIAM J. Comput. 10 (1981), 151–173.
Lawler, E. L. and Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming, J. ACM 25 (1978), 612–619.
Lenstra, J. K., Shmoys, D. B. and Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines, Math. Programming 46 (1990), 259–271.
McNaughton, R.: Scheduling with deadlines and loss functions, Management Sci. 6 (1959), 1–12.
Potts, C. N.: Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Appl. Math. 10 (1985), 155–164.
Shchepin, E. and Vakhania, N.: Task distributions on multiprocessor systems, In: Lecture Notes in Comput. Sci. 1872, Springer, New York, 2000, pp. 112–125.
Shchepin, E. and Vakhania, N.: On optimal rounding of multiprocessor distributions, Manuscript.
Shchepin, E. and Vakhania, N.: Tight NP-hardness results on preemptive multiprocessor and open-shop scheduling, Manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shchepin, E., Vakhania, N. Little-Preemptive Scheduling on Unrelated Processors. Journal of Mathematical Modelling and Algorithms 1, 43–56 (2002). https://doi.org/10.1023/A:1015674704111
Issue Date:
DOI: https://doi.org/10.1023/A:1015674704111