Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Flowtime-optimal Schedules"”.

  1. Techniques for Proving Approximation Ratios in Scheduling

    … with the lowest makespan in the class of all flowtime-optimal schedules for parallel identical machines is an NP-hard problem. Several approximation algorithms have been suggested for this problem. We focus on algorithms that are fast and easy to implement, rather than on more involved …

    waterloo Repository record for Techniques for Proving Approximation Ratios in Scheduling (opens in a new tab)