About this document
Online Job Scheduling with Favorite Machines by 482394302 is a document available to read on EtoBox.
This document discusses the online scheduling of jobs using a favorite machine model, where jobs must be allocated to machines upon arrival to minimize makespan. It presents theoretical performance guarantees for two algorithms: the Greedy algorithm and the Assign-U algorithm, with the latter being the best possible online algorithm for this problem. The study also includes computational results that demonstrate the effectiveness of these algorithms in practical applications, particularly in cloud computing
- Author
- 482394302
- Language
- EN