Scheduling two jobs with fixed and nonfixed routes. - Natalia V. Shakhlevich; Yuri N. Sotskov (Computing, 1994)

NP-hardness of Shop-scheduling Problems with Three Jobs. - Yuri N. Sotskov; Natalia V. Shakhlevich (Discret. Appl. Math., 1995)

On the solution region for certainscheduling problems with preemption. - Heidemarie Bräsel; Natalia V. Shakhlevich (Ann. Oper. Res., 1998)

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. - Natalia V. Shakhlevich; Yuri N. Sotskov; Frank Werner 001 (Ann. Oper. Res., 1999)

Complexity of mixed shop scheduling problems: A survey. - Natalia V. Shakhlevich; Yuri N. Sotskov; Frank Werner 001 (Eur. J. Oper. Res., 2000)

Common due date assignment and scheduling with ready times. - T. C. Edwin Cheng; Zhi-Long Chen; Natalia V. Shakhlevich (Comput. Oper. Res., 2002)

Three-machine shop scheduling with partially ordered processing routes. - Vitaly A. Strusevich; Inna G. Drobouchevitch; Natalia V. Shakhlevich (J. Oper. Res. Soc., 2002)

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates. - T. C. Edwin Cheng; Natalia V. Shakhlevich (J. Glob. Optim., 2003)

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. - Peter Brucker; Sigrid Knust; T. C. Edwin Cheng; Natalia V. Shakhlevich (Ann. Oper. Res., 2004)

Open shop unit-time scheduling problems with symmetric objective functions. - Natalia V. Shakhlevich (4OR, 2005)

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem. - T. C. Edwin Cheng; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2005)

Pre-Emptive Scheduling Problems with Controllable Processing Times. - Natalia V. Shakhlevich; Vitaly A. Strusevich (J. Sched., 2005)

Single machine scheduling with controllable release and processing parameters. - Natalia V. Shakhlevich; Vitaly A. Strusevich (Discret. Appl. Math., 2006)

Scheduling with controllable release dates and processing times: Makespan minimization. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2006)

Scheduling with controllable release dates and processing times: Total completion time minimization. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2006)

Two-machine open shop problem with controllable processing times. - T. C. Edwin Cheng; Natalia V. Shakhlevich (Discret. Optim., 2007)

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. - Natalia V. Shakhlevich; Akiyoshi Shioura; Vitaly A. Strusevich (ESA, 2008)

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. - Natalia V. Shakhlevich; Vitaly A. Strusevich (Algorithmica, 2008)

Single Machine Scheduling with Controllable Processing Times by submodular Optimization. - Natalia V. Shakhlevich; Akiyoshi Shioura; Vitaly A. Strusevich (Int. J. Found. Comput. Sci., 2009)

Inverse scheduling with maximum lateness objective. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2009)

Parallel batch scheduling of equal-length jobs with release and due dates. - Alessandro Condotta; Sigrid Knust; Natalia V. Shakhlevich (J. Sched., 2010)

Inverse scheduling: two-machine flow-shop problem. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2011)

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2011)

Scheduling coupled-operation jobs with exact time-lags. - Alessandro Condotta; Natalia V. Shakhlevich (Discret. Appl. Math., 2012)

Scheduling Divisible Loads to Optimize the Computation Time and Cost. - Natalia V. Shakhlevich (GECON, 2013)

Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost. - Anastasia Grekioti; Natalia V. Shakhlevich (PPAM (2), 2013)

Tabu search and lower bounds for a combined production-transportation problem. - Alessandro Condotta; Sigrid Knust; Dimitri Meier; Natalia V. Shakhlevich (Comput. Oper. Res., 2013)

Minimising the number of gap-zeros in binary matrices. - Konstantin Chakhlevitch; Celia A. Glass; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2013)

A note on reverse scheduling with maximum lateness objective. - S. S. Li; Peter Brucker; Chi To Ng 001; T. C. Edwin Cheng; Natalia V. Shakhlevich; Jinjiang Yuan (J. Sched., 2013)

A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (SIAM J. Discret. Math., 2013)

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (Math. Program., 2015)

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (DOOR, 2016)

Resource boxing: converting realistic cloud task utilization patterns for theoretical scheduling. - Bernhard Primas; Peter Garraghan; Karim Djemame; Natalia V. Shakhlevich (UCC, 2016)

The assignment problem with nearly Monge arrays and incompatible partner indices. - Christian Weiß 003; Sigrid Knust; Natalia V. Shakhlevich; Stefan Waldherr (Discret. Appl. Math., 2016)

Complexity results for storage loading problems with stacking constraints. - Florian Bruns; Sigrid Knust; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2016)

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (INFORMS J. Comput., 2016)

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. - Peter Brucker; Natalia V. Shakhlevich (J. Sched., 2016)

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (INFORMS J. Comput., 2017)

Open Shop Scheduling with Synchronization. - Christian Weiß 003; Stefan Waldherr; Sigrid Knust; Natalia V. Shakhlevich (J. Sched., 2017)

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (Eur. J. Oper. Res., 2018)

Models and algorithms for energy-efficient scheduling with immediate start of jobs. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich; Bernhard Primas (J. Sched., 2018)

Shop scheduling problems with pliable jobs. - Sigrid Knust; Natalia V. Shakhlevich; Stefan Waldherr; Christian Weiß 003 (J. Sched., 2019)

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. - Akiyoshi Shioura; Natalia V. Shakhlevich; Vitaly A. Strusevich (J. Glob. Optim., 2020)

Scheduling divisible loads with time and cost constraints. - Maciej Drozdowski; Natalia V. Shakhlevich (J. Sched., 2021)

Affinity-aware resource provisioning for long-running applications in shared clusters. - Clément Mommessin; Renyu Yang; Natalia V. Shakhlevich; Xiaoyang Sun; Satish Kumar; Junqing Xiao; Jie Xu 007 (J. Parallel Distributed Comput., 2023)

Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. - Akiyoshi Shioura; Vitaly A. Strusevich; Natalia V. Shakhlevich (Networks, 2024)

Preemptive scheduling of parallel jobs of two sizes with controllable processing times. - Akiyoshi Shioura; Vitaly A. Strusevich; Natalia V. Shakhlevich (J. Sched., 2024)

Classification and evaluation of the algorithms for vector bin packing. - Clément Mommessin; Thomas Erlebach; Natalia V. Shakhlevich (Comput. Oper. Res., 2025)