Abstract
We discuss variants of online scheduling on identical and uniformly related machines, where the objective is to minimize the makespan. All variants are such that some information regarding the input is provided in advance, and therefore these models are known as semi-online problems. Algorithms are analyzed with respect to the competitive ratio. We discuss the benefit arising from different kinds of available information and find that almost all variants allow one to reduce the competitive ratio significantly compared to the best possible competitive ratio for the corresponding pure online problem.
| Original language | American English |
|---|---|
| Pages (from-to) | 269-284 |
| Number of pages | 16 |
| Journal | Journal of Scheduling |
| Volume | 21 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jun 2018 |
Keywords
- Bin stretching
- Competitive ratio
- Known total size
- Reassignment
- Reordering buffers
- Semi-online algorithms
All Science Journal Classification (ASJC) codes
- Software
- General Engineering
- Artificial Intelligence
- Management Science and Operations Research