Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
From MaRDI portal
Publication:2323435
DOI10.1007/s10100-018-0536-9OpenAlexW4241524998WikidataQ130041039 ScholiaQ130041039MaRDI QIDQ2323435
Zsolt Tuza, Zhiyi Tan, Krzysztof Węsek, Armin Fügenschuh, György Dósa
Publication date: 2 September 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/105443/1/154883077.pdf
Related Items
Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence, Semi-online scheduling: a survey, Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-online scheduling problems on a small number of machines
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Online bin stretching with bunch techniques
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi on-line scheduling on three processors with known sum of the tasks
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Two semi-online scheduling problems on two uniform machines
- Semi on-line algorithms for the partition problem
- Bin stretching revisited
- On-line scheduling revisited
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Online bin stretching with three bins
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- An efficient algorithm for bin stretching
- Semi-online scheduling on two uniform processors
- Better Algorithms for Online Bin Stretching
- Better Bounds for Online Scheduling
- On-Line Load Balancing for Related Machines
- Bounds for Certain Multiprocessing Anomalies
- Randomized on-line scheduling on two uniform machines
- On-line bin-stretching
