Natalia V. Shakhlevich

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