( en | de | ru )

 

Disambiguation of "Shakhlevich, Natalia V."

Author of the publication

copydeleteadd this publication to your clipboard
Resource boxing: converting realistic cloud task utilization patterns for theoretical scheduling.

, , , and . UCC, page 138-147. ACM, (2016)

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.

V Geoffroy

V Saile

V Wittwer

V Ustinov

V Fendrich

 

Other publications of authors with the same name

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times., , and . Math. Program., 153 (2): 495-534 (2015)Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches., , and . Eur. J. Oper. Res., 266 (3): 795-818 (2018)Affinity-Aware Resource Provisioning for Long-Running Applications in Shared Clusters., , , , , , and . CoRR, (2022)Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization., , and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 74-90. Springer, (2016)Complexity of mixed shop scheduling problems: A survey., , and . Eur. J. Oper. Res., 120 (2): 343-351 (2000)Resource boxing: converting realistic cloud task utilization patterns for theoretical scheduling., , , and . UCC, page 138-147. ACM, (2016)A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines., , and . SIAM J. Discret. Math., 27 (1): 186-204 (2013)Models and algorithms for energy-efficient scheduling with immediate start of jobs., , , and . J. Sched., 21 (5): 505-516 (2018)Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost., and . PPAM (2), volume 8385 of Lecture Notes in Computer Science, page 3-12. Springer, (2013)Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach., , and . ESA, volume 5193 of Lecture Notes in Computer Science, page 756-767. Springer, (2008)