Natalia V. Shakhlevich

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 17

Top Topics

Affinity Measure

Tardiness Penalties

Scheduling Problem

Identical Parallel Machines

Top Venues

INFORMS J. Comput.

Eur. J. Oper. Res.

Publications

Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27 (2) (2024)
Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83 (3) (2024)
Clément Mommessin, Renyu Yang, Natalia V. Shakhlevich, Xiaoyang Sun, Satish Kumar, Junqing Xiao, Jie Xu
Affinity-aware resource provisioning for long-running applications in shared clusters. J. Parallel Distributed Comput. 177 (2023)
Clément Mommessin, Renyu Yang, Natalia V. Shakhlevich, Xiaoyang Sun, Satish Kumar, Junqing Xiao, Jie Xu
Affinity-Aware Resource Provisioning for Long-Running Applications in Shared Clusters. CoRR (2022)
Maciej Drozdowski, Natalia V. Shakhlevich
Scheduling divisible loads with time and cost constraints. J. Sched. 24 (5) (2021)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76 (3) (2020)
Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr, Christian Weiß
Shop scheduling problems with pliable jobs. J. Sched. 22 (6) (2019)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266 (3) (2018)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21 (5) (2018)
Christian Weiß, Stefan Waldherr, Sigrid Knust, Natalia V. Shakhlevich
Open Shop Scheduling with Synchronization. J. Sched. 20 (6) (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29 (4) (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR (2016)
Peter Brucker, Natalia V. Shakhlevich
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. J. Sched. 19 (6) (2016)
Florian Bruns, Sigrid Knust, Natalia V. Shakhlevich
Complexity results for storage loading problems with stacking constraints. Eur. J. Oper. Res. 249 (3) (2016)
Christian Weiß, Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr
The assignment problem with nearly Monge arrays and incompatible partner indices. Discret. Appl. Math. 211 (2016)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28 (1) (2016)
Bernhard Primas, Peter Garraghan, Karim Djemame, Natalia V. Shakhlevich
Resource boxing: converting realistic cloud task utilization patterns for theoretical scheduling. UCC (2016)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153 (2) (2015)
Anastasia Grekioti, Natalia V. Shakhlevich
Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost. PPAM (2) (2013)
S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan
A note on reverse scheduling with maximum lateness objective. J. Sched. 16 (4) (2013)
Konstantin Chakhlevitch, Celia A. Glass, Natalia V. Shakhlevich
Minimising the number of gap-zeros in binary matrices. Eur. J. Oper. Res. 229 (1) (2013)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27 (1) (2013)
Natalia V. Shakhlevich
Scheduling Divisible Loads to Optimize the Computation Time and Cost. GECON (2013)
Alessandro Condotta, Sigrid Knust, Dimitri Meier, Natalia V. Shakhlevich
Tabu search and lower bounds for a combined production-transportation problem. Comput. Oper. Res. 40 (3) (2013)
Alessandro Condotta, Natalia V. Shakhlevich
Scheduling coupled-operation jobs with exact time-lags. Discret. Appl. Math. 160 (16-17) (2012)
Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling: two-machine flow-shop problem. J. Sched. 14 (3) (2011)
Peter Brucker, Natalia V. Shakhlevich
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Sched. 14 (4) (2011)
Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich
Parallel batch scheduling of equal-length jobs with release and due dates. J. Sched. 13 (5) (2010)
Peter Brucker, Natalia V. Shakhlevich
Inverse scheduling with maximum lateness objective. J. Sched. 12 (5) (2009)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20 (2) (2009)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51 (4) (2008)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA (2008)
T. C. Edwin Cheng, Natalia V. Shakhlevich
Two-machine open shop problem with controllable processing times. Discret. Optim. 4 (2) (2007)
T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
Scheduling with controllable release dates and processing times: Makespan minimization. Eur. J. Oper. Res. 175 (2) (2006)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154 (15) (2006)
T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich
Scheduling with controllable release dates and processing times: Total completion time minimization. Eur. J. Oper. Res. 175 (2) (2006)
Natalia V. Shakhlevich
Open shop unit-time scheduling problems with symmetric objective functions. 4OR 3 (2) (2005)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Pre-Emptive Scheduling Problems with Controllable Processing Times. J. Sched. 8 (3) (2005)
T. C. Edwin Cheng, Natalia V. Shakhlevich
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. Eur. J. Oper. Res. 165 (2) (2005)
Peter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129 (1-4) (2004)
T. C. Edwin Cheng, Natalia V. Shakhlevich
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. J. Glob. Optim. 27 (2-3) (2003)
Vitaly A. Strusevich, Inna G. Drobouchevitch, Natalia V. Shakhlevich
Three-machine shop scheduling with partially ordered processing routes. J. Oper. Res. Soc. 53 (5) (2002)
T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich
Common due date assignment and scheduling with ready times. Comput. Oper. Res. 29 (14) (2002)
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
Complexity of mixed shop scheduling problems: A survey. Eur. J. Oper. Res. 120 (2) (2000)
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. Ann. Oper. Res. 92 (1999)
Heidemarie Bräsel, Natalia V. Shakhlevich
On the solution region for certainscheduling problems with preemption. Ann. Oper. Res. 83 (1998)
Yuri N. Sotskov, Natalia V. Shakhlevich
NP-hardness of Shop-scheduling Problems with Three Jobs. Discret. Appl. Math. 59 (3) (1995)
Natalia V. Shakhlevich, Yuri N. Sotskov
Scheduling two jobs with fixed and nonfixed routes. Computing 52 (1) (1994)