Abstract
We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selecting the best solution out of two independent solutions constructed in parallel in an online fashion. Two cases are analyzed, where one case is purely online, and in the other one jobs are presented sorted by non-increasing sizes. We show that using two solutions rather than one improves the performance significantly, but that an optimal solution cannot be obtained for any constant number of solutions constructed in parallel. Our algorithms have the best possible competitive ratios out of algorithms for each one of the classes.
| Original language | English |
|---|---|
| Pages (from-to) | 61-76 |
| Number of pages | 16 |
| Journal | Journal of Scheduling |
| Volume | 26 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 2023 |
Bibliographical note
Publisher Copyright:© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Competitive ratio
- Jobs arriving over a list
- Parallel solutions
- Preemptive scheduling
ASJC Scopus subject areas
- Software
- General Engineering
- Management Science and Operations Research
- Artificial Intelligence