Semi-online preemptive scheduling: study of special cases

0439552 - MÚ 2015 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš
Semi-online preemptive scheduling: study of special cases.
Parallel Processing and Applied Mathematics. Vol. Part 2. Berlin: Springer, 2010 - (Wyrzykowski, R.; Dongarra, J.; Karczewski, K.), s. 11-20. Lecture Notes in Computer Science, 6068. ISBN 978-3-642-14402-8.
[Parallel processing and applied mathematics. Wroclaw (PL), 13.09.2009-16.09.2009]
Institutional research plan: CEZ:AV0Z1019905
Keywords : scheduling
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-14403-5_2

We use the duality of linear programming to obtain exact formulas of competitive ratio for the semi-online preemptive scheduling on three and four machines We use the linear programs from [3] Namely we consider the online scheduling and the semi-online scheduling with known sum of processing times We solve the linear programs symbolically by examining all basic solution candidates All solutions are obtained by a computer but all are verifiable by hand.
Permanent Link: http://hdl.handle.net/11104/0242818