Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Authors:
- 5 April 2018
- journal article
- research article
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 27 (4) , 1107-1130
Abstract
No abstract availableKeywords
Funding Information
- NKFIH (SNN 116095, SNN 116095)
- National Natural Science Foundation of China (11671356, 11271324)
- National Natural Science Foundation of China (11471286)
- European Social Fund Plus (n/a)
- Széchenyi 2020 (EFOP-3.6.1-16-2016-00015)
This publication has 22 references indexed in Scilit:
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimumCentral European Journal of Operations Research, 2017
- A two-phase algorithm for bin stretching with stretching factor 1.5Journal of Combinatorial Optimization, 2017
- Online bin stretching with three binsJournal of Scheduling, 2017
- Better Algorithms for Online Bin Stretching2015
- Semi-online scheduling on two uniform processorsTheoretical Computer Science, 2008
- Semi on-line scheduling on three processors with known sum of the tasksJournal of Scheduling, 2007
- Semi-on-line multiprocessor scheduling with given total processing timeTheoretical Computer Science, 2005
- On-line bin-stretchingTheoretical Computer Science, 2001
- On-Line Load Balancing for Related MachinesJournal of Algorithms, 2000
- Better Bounds for Online SchedulingSIAM Journal on Computing, 1999