Author of the publication

Approximation in Preemptive Stochastic Online Scheduling.

, and . ESA, volume 4168 of Lecture Notes in Computer Science, page 516-527. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

New Results on Online Resource Minimization., , and . CoRR, (2014)Optimally handling commitment issues in online throughput maximization., , and . CoRR, (2019)Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword., and . Theory of Computing, 12 (1): 1-3 (2016)Online Graph Exploration: New Results on Old and New Algorithms., , and . ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 478-489. Springer, (2011)Stochastic Online Scheduling on Parallel Machines., , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 167-180. Springer, (2004)Approximation in Preemptive Stochastic Online Scheduling., and . ESA, volume 4168 of Lecture Notes in Computer Science, page 516-527. Springer, (2006)Scheduling Self-Suspending Tasks: New and Old Results (Artifact)., , , , and . Dagstuhl Artifacts Ser., 5 (1): 06:1-06:3 (2019)Optimal algorithms for scheduling under time-of-use tariffs., , , , and . Ann. Oper. Res., 304 (1): 85-107 (2021)Scheduling (Dagstuhl Seminar 23061)., , , , , and . Dagstuhl Reports, 13 (2): 1-19 (February 2023)How to whack moles., , , and . Theor. Comput. Sci., 361 (2-3): 329-341 (2006)