An improved randomized on-line algorithm for a weighted interval selection problem

DOI10.1023/B:JOSH.0000031423.39762.d3zbMath1154.90475OpenAlexW2022187611MaRDI QIDQ2464426

Hiroyuki Miyazawa, Erlebach, Thomas

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:josh.0000031423.39762.d3

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Online selection of intervals and \(t\)-intervals ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Online interval scheduling with a bounded number of failures ⋮ Improved Randomized Results for That Interval Selection Problem ⋮ Online C-benevolent job scheduling on multiple machines ⋮ Improved randomized online scheduling of intervals and jobs ⋮ Interval scheduling on related machines ⋮ Improved randomized results for the interval selection problem ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Online interval scheduling to maximize total satisfaction ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES

Uses Software

• MOCA

This page was built for publication: An improved randomized on-line algorithm for a weighted interval selection problem