( en | de | ru )

 

Disambiguation of "Shakhlevich, Natalia V."

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of mixed shop scheduling problems: A survey.

, , and . Eur. J. Oper. Res., 120 (2): 343-351 (2000)

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 Ustinov

V Fendrich

V Adams

 

Other publications of authors with the same name

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)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)Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates., and . J. Glob. Optim., 27 (2-3): 293-311 (2003)Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem., and . Eur. J. Oper. Res., 165 (2): 444-456 (2005)Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times., and . Algorithmica, 51 (4): 451-473 (2008)Affinity-aware resource provisioning for long-running applications in shared clusters., , , , , , and . J. Parallel Distributed Comput., (July 2023)NP-hardness of Shop-scheduling Problems with Three Jobs., and . Discret. Appl. Math., 59 (3): 237-266 (1995)Tabu search and lower bounds for a combined production-transportation problem., , , and . Comput. Oper. Res., 40 (3): 886-900 (2013)Common due date assignment and scheduling with ready times., , and . Comput. Oper. Res., 29 (14): 1957-1967 (2002)Complexity of mixed shop scheduling problems: A survey., , and . Eur. J. Oper. Res., 120 (2): 343-351 (2000)