Publication

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Abstract

We study online scheduling on m uniform machines, where m - 1 of them have a reference speed 1 and the last one a speed s with 0

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.