Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
We study preemptive scheduling on uniformly related pro- cessors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non- decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.
Unable to display preview. Download preview PDF.
- 4.L. Epstein, J. Noga, S.S. Seiden, J. Sgall, and G.J. Woeginger. Randomized online scheduling on two uniform machines. In Annual ACM-SIAM Symposium on Discrete Algorithms, pages 317–326, 1999. To appear in Journal of Scheduling.Google Scholar
- 10.A. P. A. Vestjens. Scheduling uniform machines on-line requires nondecreasing speed ratios. Technical Report Memorandum COSOR 94-35, Eindhoven University of Technology, 1994. To appear in Math. Programming.Google Scholar