Natalia V. Shakhlevich

发表

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2018, Eur. J. Oper. Res..

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs

Frank Werner, Natalia V. Shakhlevich, Yuri N. Sotskov, 1999, Ann. Oper. Res..

A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2013, SIAM J. Discret. Math..

Open Shop Scheduling with Synchronization

Sigrid Knust, Stefan Waldherr, Natalia V. Shakhlevich, 2017, J. Sched..

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

Natalia V. Shakhlevich, Frank Werner, Karin Krüger, 1995 .

Pre-Emptive Scheduling Problems with Controllable Processing Times

Vitaly A. Strusevich, Natalia V. Shakhlevich, 2005, J. Sched..

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Vitaly A. Strusevich, Bernhard Primas, Akiyoshi Shioura, 2017, Journal of Scheduling.

Energy Optimization in Speed Scaling Models via Submodular Optimization (Theoretical Foundations of Computing)

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2014 .

Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates

T. C. Edwin Cheng, Natalia V. Shakhlevich, N. V. Shakhlevich, 2003, J. Glob. Optim..

Scheduling with controllable release dates and processing times: Total completion time minimization

T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich, 2006, Eur. J. Oper. Res..

Scheduling two jobs with fixed and nonfixed routes

Natalia V. Shakhlevich, Yuri N. Sotskov, 2005, Computing.

Three-machine shop scheduling with partially ordered processing routes

Vitaly A. Strusevich, Natalia V. Shakhlevich, Inna G. Drobouchevitch, 2002, J. Oper. Res. Soc..

Scheduling divisible loads with time and cost constraints

Maciej Drozdowski, Natalia V. Shakhlevich, N. V. Shakhlevich, 2019, Journal of Scheduling.

Common due date assignment and scheduling with ready times

T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich, 2002, Comput. Oper. Res..

A note on reverse scheduling with maximum lateness objective

T. C. Edwin Cheng, J. J. Yuan, Peter Brucker, 2013, J. Sched..

Parallel batch scheduling of equal-length jobs with release and due dates

Sigrid Knust, Natalia V. Shakhlevich, N. V. Shakhlevich, 2010, J. Sched..

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2017, INFORMS J. Comput..

Proportionate flow shop with controllable processing times

T. C. Edwin Cheng, Natalia V. Shakhlevich, N. V. Shakhlevich, 1999 .

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2015, Math. Program..

Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

T. C. Edwin Cheng, Natalia V. Shakhlevich, N. V. Shakhlevich, 2005, Eur. J. Oper. Res..

Scheduling Bag-of-Tasks Applications to Optimize Computation Time and Cost

Natalia V. Shakhlevich, N. V. Shakhlevich, Anastasia Grekioti, 2013, PPAM.

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2016, DOOR.

Tabu search and lower bounds for a combined production-transportation problem

Sigrid Knust, Natalia V. Shakhlevich, Alessandro Condotta, 2013, Comput. Oper. Res..

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2020, J. Glob. Optim..

Open shop unit-time scheduling problems with symmetric objective functions

Natalia V. Shakhlevich, 2005, 4OR.

Inverse scheduling with maximum lateness objective

Peter Brucker, Natalia V. Shakhlevich, N. V. Shakhlevich, 2009, J. Sched..

Complexity of mixed shop scheduling problems: A survey

Frank Werner, Natalia V. Shakhlevich, Yuri N. Sotskov, 2000, Eur. J. Oper. Res..

Minimising the number of gap-zeros in binary matrices

Celia A. Glass, Konstantin Chakhlevitch, Natalia V. Shakhlevich, 2013, Eur. J. Oper. Res..

Scheduling coupled-operation jobs with exact time-lags

Natalia V. Shakhlevich, N. V. Shakhlevich, Alessandro Condotta, 2012, Discret. Appl. Math..

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2008, ESA.

The assignment problem with nearly Monge arrays and incompatible partner indices

Sigrid Knust, Stefan Waldherr, Natalia V. Shakhlevich, 2016, Discret. Appl. Math..

Two-machine open shop problem with controllable processing times

T. C. Edwin Cheng, Natalia V. Shakhlevich, N. V. Shakhlevich, 2007, Discret. Optim..

Scheduling with controllable release dates and processing times: Makespan minimization

T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich, 2006, Eur. J. Oper. Res..

NP-hardness of Shop-scheduling Problems with Three Jobs

Natalia V. Shakhlevich, Yuri N. Sotskov, N. V. Shakhlevich, 1995, Discret. Appl. Math..

Scheduling imprecise computations on parallel machines with linear and nonlinear error penalties

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2015 .

Scheduling Divisible Loads to Optimize the Computation Time and Cost

Natalia V. Shakhlevich, 2013, GECON.

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines

Peter Brucker, Natalia V. Shakhlevich, N. V. Shakhlevich, 2016, J. Sched..

Complexity results for storage loading problems with stacking constraints

Florian Bruns, Sigrid Knust, Natalia V. Shakhlevich, 2016, Eur. J. Oper. Res..

Inverse scheduling: two-machine flow-shop problem

Peter Brucker, Natalia V. Shakhlevich, 2011, J. Sched..

On the solution region for certainscheduling problems with preemption

Natalia V. Shakhlevich, Heidemarie Bräsel, 1998, Ann. Oper. Res..

Single Machine Scheduling with Controllable Processing Times by submodular Optimization

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2009, Int. J. Found. Comput. Sci..

Single machine scheduling with controllable release and processing parameters

Vitaly A. Strusevich, Natalia V. Shakhlevich, N. V. Shakhlevich, 2006, Discret. Appl. Math..

Minimizing total weighted completion time in a proportionate flow shop

Han Hoogeveen, Michael Pinedo, Natalia V. Shakhlevich, 1998 .

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2016, INFORMS J. Comput..

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

Vitaly A. Strusevich, Natalia V. Shakhlevich, N. V. Shakhlevich, 2008, Algorithmica.

Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays

T. C. Edwin Cheng, Peter Brucker, Sigrid Knust, 2004, Ann. Oper. Res..

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

Peter Brucker, Natalia V. Shakhlevich, 2011, J. Sched..

Scheduling Imprecise Computation Tasks on Parallel Machines to Minimize Linear and Non-Linear Error Penalties : Reviews , Links and Improvements

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2015 .