Semi-online preemptive scheduling: study of special cases

Authors:
Tomáš Ebenlendr
Affiliations:
Institute of Mathematics, AS CR, Praha 1, Czech Republic
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Year:
2009

Citing 5
Cited 0

A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive online scheduling: optimal algorithms for all speeds

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information

Acta Informatica
Optimal preemptive semi-online scheduling on two uniform processors

Information Processing Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use the duality of linear programing 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.