Name
Abstract | ||
|---|---|---|
We consider an online interval scheduling problem on two related machines. If one machine is at least as twice as fast as the other machine, we say the machines are distinct; otherwise the machines are said to be similar. Each job \(j \in J\) is characterized by a length \(p_j\), and an arrival time \(t_j\); the question is to determine whether there exists a feasible schedule such that each job starts processing at its arrival time. For the case of unit-length jobs, we prove that when the two machines are distinct, there is an amount of lookahead allowing an online algorithm to solve the problem. When the two machines are similar, we show that no finite amount of lookahead is sufficient to solve the problem in an online fashion. We extend these results to jobs having arbitrary lengths, and consider an extension focused on minimizing total waiting time. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10878-019-00381-6 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Online algorithms, Interval scheduling, Lookahead, Competitive ratio | Online algorithm,Mathematical optimization,Existential quantification,Interval scheduling,Mathematics,Competitive analysis | Journal |
Volume | Issue | ISSN |
38.0 | 1.0 | 1573-2886 |
Citations | PageRank | References |
1 | 0.35 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Pinson | 1 | 1 | 0.35 |
| Frits C. R. Spieksma | 2 | 591 | 58.84 |