( en | de | ru )

 

Disambiguation of "Shakhlevich, Natalia V."

Author of the publication

copydeleteadd this publication to your clipboard
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.

, and . Algorithmica, 51 (4): 451-473 (2008)

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 Saile

V Geoffroy

V Ustinov

V Fendrich

V Adams

 

Other publications of authors with the same name

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates., and . J. Glob. Optim., 27 (2-3): 293-311 (2003)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)Affinity-aware resource provisioning for long-running applications in shared clusters., , , , , , and . J. Parallel Distributed Comput., (July 2023)Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem., and . Eur. J. Oper. Res., 165 (2): 444-456 (2005)Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines., , and . INFORMS J. Comput., 28 (1): 148-161 (2016)Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times., and . Algorithmica, 51 (4): 451-473 (2008)NP-hardness of Shop-scheduling Problems with Three Jobs., and . Discret. Appl. Math., 59 (3): 237-266 (1995)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)Minimising the number of gap-zeros in binary matrices., , and . Eur. J. Oper. Res., 229 (1): 48-58 (2013)A polynomial-time algorithm for a flow-shop batching problem with equal-length operations., and . J. Sched., 14 (4): 371-389 (2011)