Searching for authors named "Pavlos Efraimidis" – sorted by Relevance.
-
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
- The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is fixed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed,
- Cited by 2 (0 self) – Add To MetaCart

