### Uittreksel

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∈ 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.

Taal | Engels |
---|---|

Pagina's | 224-253 |

Tijdschrift | Journal of Combinatorial Optimization |

Volume | 38 |

Nummer van het tijdschrift | 1 |

Vroegere onlinedatum | 9 jan 2019 |

DOI's | |

Status | Gepubliceerd - 1 jul 2019 |

### Vingerafdruk

### Trefwoorden

### Citeer dit

*Journal of Combinatorial Optimization*,

*38*(1), 224-253. DOI: 10.1007/s10878-019-00381-6

}

*Journal of Combinatorial Optimization*, vol. 38, nr. 1, blz. 224-253. DOI: 10.1007/s10878-019-00381-6

**Online interval scheduling on two related machines : the power of lookahead.** / Pinson, Nicolas; Spieksma, Frits C.R. (Corresponding author).

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

TY - JOUR

T1 - Online interval scheduling on two related machines

T2 - Journal of Combinatorial Optimization

AU - Pinson,Nicolas

AU - Spieksma,Frits C.R.

PY - 2019/7/1

Y1 - 2019/7/1

N2 - 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∈ J is characterized by a length pj, and an arrival time tj; 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.

AB - 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∈ J is characterized by a length pj, and an arrival time tj; 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.

KW - Competitive ratio

KW - Interval scheduling

KW - Lookahead

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=85059871632&partnerID=8YFLogxK

U2 - 10.1007/s10878-019-00381-6

DO - 10.1007/s10878-019-00381-6

M3 - Article

VL - 38

SP - 224

EP - 253

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 1

ER -