Vitaly A. Strusevich

According to our database, Vitaly A. Strusevich authored at least 100 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Preemptive scheduling of parallel jobs of two sizes with controllable processing times.

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

J. Sched., April, 2024

2023

An FPTAS for scheduling with resource constraints.

Bo Chen, Vitaly A. Strusevich

Oper. Res. Lett., July, 2023

A historical note on the complexity of scheduling problems.

Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach

Oper. Res. Lett., January, 2023

The two-flight low risk helicopter transportation problem under the split pickup scenario.

Hans Kellerer, Vitaly A. Strusevich

EURO J. Transp. Logist., 2023

2022

Preemptive and non-preemptive scheduling on two unrelated parallel machines.

Alan J. Soper, Vitaly A. Strusevich

J. Sched., 2022

Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches.

Vitaly A. Strusevich

Comput. Oper. Res., 2022

2021

Approximation algorithms for makespan minimization on identical parallel machines under resource constraints.

Vitaly A. Strusevich

J. Oper. Res. Soc., 2021

Parametric analysis of the quality of single preemption schedules on three uniform parallel machines.

Alan J. Soper, Vitaly A. Strusevich

Ann. Oper. Res., 2021

2020

Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects.

Alan J. Soper, Vitaly A. Strusevich

J. Sched., 2020

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

Minmax scheduling and due-window assignment with position-dependent processing times and job rejection.

Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich

4OR, 2020

2019

Schedules with a single preemption on uniform parallel machines.

Alan J. Soper, Vitaly A. Strusevich

Discret. Appl. Math., 2019

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

The Block Retrieval Problem.

Marcos de Melo da Silva, Günes Erdogan, Maria Battarra, Vitaly A. Strusevich

Eur. J. Oper. Res., 2018

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

Two-machine flow shop and open shop scheduling problems with a single maintenance window.

Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich, Jonathan Mosheiff

Eur. J. Oper. Res., 2018

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.

Nir Halman, Hans Kellerer, Vitaly A. Strusevich

Eur. J. Oper. Res., 2018

2017

Approximability issues for unconstrained and constrained maximization of half-product related functions.

Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich

Theor. Comput. Sci., 2017

Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.

Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich

SIAM J. Discret. Math., 2017

Single machine scheduling with a generalized job-dependent cumulative effect.

Kabir Rustogi, Vitaly A. Strusevich

J. Sched., 2017

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

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

INFORMS J. Comput., 2017

Differential approximation schemes for half-product related functions and their scheduling applications.

Rebecca Sarto Basso, Vitaly A. Strusevich

Discret. Appl. Math., 2017

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

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications.

Hans Kellerer, Vitaly A. Strusevich

Ann. Oper. Res., 2016

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization.

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

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

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

Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance.

Kabir Rustogi, Vitaly A. Strusevich

J. Oper. Res. Soc., 2015

2014

Single parameter analysis of power of preemption on two and three uniform machines.

Alan J. Soper, Vitaly A. Strusevich

Discret. Optim., 2014

An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order.

Richard Quibell, Vitaly A. Strusevich

Comput. Ind. Eng., 2014

Power of Preemption on Uniform Parallel Machines.

Alan J. Soper, Vitaly A. Strusevich

Proceedings of the Approximation, 2014

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

Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.

Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich

J. Sched., 2013

Preemptive scheduling on two identical parallel machines with a single transporter.

Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich

J. Comb. Optim., 2013

Parallel Machine Scheduling: Impact of Adding Extra Machines.

Kabir Rustogi, Vitaly A. Strusevich

Oper. Res., 2013

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.

Hans Kellerer, Vitaly A. Strusevich

Eur. J. Oper. Res., 2013

An overview of computational issues in combinatorial optimization.

Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich

Ann. Oper. Res., 2013

2012

Scheduling with due date assignment under special conditions on job processing.

Valery S. Gordon, Vitaly A. Strusevich, Alexandre Dolgui

J. Sched., 2012

Vyacheslav Tanaev: contributions to scheduling and related areas.

Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov

J. Sched., 2012

Editorial: new branches, old roots.

Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich

J. Sched., 2012

Simple matching vs linear assignment in scheduling models with positional effects: A critical review.

Kabir Rustogi, Vitaly A. Strusevich

Eur. J. Oper. Res., 2012

Single machine scheduling with precedence constraints and positionally dependent processing times.

Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich

Comput. Oper. Res., 2012

The symmetric quadratic knapsack problem: approximation and scheduling applications.

Hans Kellerer, Vitaly A. Strusevich

4OR, 2012

2011

Hamiltonian properties of locally connected graphs with bounded vertex degree.

Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich

Discret. Appl. Math., 2011

2010

Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack.

Hans Kellerer, Vitaly A. Strusevich

Int. J. Found. Comput. Sci., 2010

Scheduling incompatible tasks on two machines.

Irina N. Lushchakova, Vitaly A. Strusevich

Eur. J. Oper. Res., 2010

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.

Hans Kellerer, Vitaly A. Strusevich

Algorithmica, 2010

Transporting Jobs through a Processing Center with Two Parallel Machines.

Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Fifty years of scheduling: a survey of milestones.

Chris N. Potts, Vitaly A. Strusevich

J. Oper. Res. Soc., 2009

Single Machine Scheduling with Controllable Processing Times by submodular Optimization.

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

Int. J. Found. Comput. Sci., 2009

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval.

Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich

Eur. J. Oper. Res., 2009

Single machine scheduling and due date assignment with positionally dependent processing times.

Valery S. Gordon, Vitaly A. Strusevich

Eur. J. Oper. Res., 2009

Approximation results for flow shop scheduling problems with machine availability constraints.

Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich

Comput. Oper. Res., 2009

Guest Editorial.

Gerd Finke, Vitaly A. Strusevich, Frank Werner

Comput. Oper. Res., 2009

Operator non-availability periods.

Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich

4OR, 2009

2008

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.

Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead

J. Sched., 2008

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.

Natalia V. Shakhlevich, Vitaly A. Strusevich

Algorithmica, 2008

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

Proceedings of the Algorithms, 2008

2007

An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter.

Alan J. Soper, Vitaly A. Strusevich

Int. J. Found. Comput. Sci., 2007

On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.

Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich

Electron. Notes Discret. Math., 2007

2006

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.

Hans Kellerer, Vitaly A. Strusevich

Theor. Comput. Sci., 2006

Three is easy, two is hard: open shop sum-batch scheduling problem refined.

Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra

Oper. Res. Lett., 2006

Planning Machine Maintenance in Two-Machine Shop Scheduling.

Mikhail A. Kubzin, Vitaly A. Strusevich

Oper. Res., 2006

Single machine scheduling with controllable release and processing parameters.

Natalia V. Shakhlevich, Vitaly A. Strusevich

Discret. Appl. Math., 2006

2005

Pre-Emptive Scheduling Problems with Controllable Processing Times.

Natalia V. Shakhlevich, Vitaly A. Strusevich

J. Sched., 2005

Hans Kellerer, Ulrich Pferschy and David Pisinger, <i>Knapsack Problems</i>, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95.

Vitaly A. Strusevich

Oper. Res. Lett., 2005

Two-machine flow shop scheduling problems with no-wait jobs.

Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich

Oper. Res. Lett., 2005

Two-machine shop scheduling: Compromise between flexibility and makespan value.

Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich

Eur. J. Oper. Res., 2005

Two-machine flow shop no-wait scheduling with machine maintenance.

Mikhail A. Kubzin, Vitaly A. Strusevich

4OR, 2005

2004

Scheduling with Due Date Assignment.

Valery S. Gordon, Jean-Marie Proth, Vitaly A. Strusevich

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints.

Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich

J. Comb. Optim., 2004

Batching decisions for assembly production systems.

Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich

Eur. J. Oper. Res., 2004

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.

Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich

Ann. Oper. Res., 2004

2003

Non-preemptive two-machine open shop scheduling with non-availability constraints.

Joachim Breit, Günter Schmidt, Vitaly A. Strusevich

Math. Methods Oper. Res., 2003

Scheduling parallel dedicated machines under a single non-shared resource.

Hans Kellerer, Vitaly A. Strusevich

Eur. J. Oper. Res., 2003

Scheduling problems for parallel dedicated machines under multiple resource constraints.

Hans Kellerer, Vitaly A. Strusevich

Discret. Appl. Math., 2003

Preface: International Symposium on Combinatorial Optimisation.

Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich

Discret. Appl. Math., 2003

2002

Three-machine shop scheduling with partially ordered processing routes.

Vitaly A. Strusevich, Inna G. Drobouchevitch, Natalia V. Shakhlevich

J. Oper. Res. Soc., 2002

2001

Two-machine open shop scheduling with an availability constraint.

Joachim Breit, Günter Schmidt, Vitaly A. Strusevich

Oper. Res. Lett., 2001

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.

Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich

INFORMS J. Comput., 2001

Two-stage open shop scheduling with a bottleneck machine.

Inna G. Drobouchevitch, Vitaly A. Strusevich

Eur. J. Oper. Res., 2001

2000

Group technology approach to the open shop scheduling problem with batch setup times.

Vitaly A. Strusevich

Oper. Res. Lett., 2000

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine.

Inna G. Drobouchevitch, Vitaly A. Strusevich

Eur. J. Oper. Res., 2000

1999

Two-machine open shop scheduling with special transportation times.

Djamal Rebaine, Vitaly A. Strusevich

J. Oper. Res. Soc., 1999

A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times.

Vitaly A. Strusevich, A. J. A. van de Waart, Rommert Dekker

J. Heuristics, 1999

A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.

Vitaly A. Strusevich

Discret. Appl. Math., 1999

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment.

Valery S. Gordon, Vitaly A. Strusevich

Comput. Oper. Res., 1999

A polynomial algorithm for the three‐machineopen shop with a bottleneck machine.

Inna G. Drobouchevitch, Vitaly A. Strusevich

Ann. Oper. Res., 1999

A heuristic algorithm for two-machine re-entrant shop scheduling.

Inna G. Drobouchevitch, Vitaly A. Strusevich

Ann. Oper. Res., 1999

1998

Approximation algorithms for two-machine flow shop scheduling with batch setup times.

Bo Chen, Chris N. Potts, Vitaly A. Strusevich

Math. Program., 1998

Heuristics for short route job shop scheduling problems.

Inna G. Drobouchevitch, Vitaly A. Strusevich

Math. Methods Oper. Res., 1998

A greedy open shop heuristic with job priorities.

Vitaly A. Strusevich

Ann. Oper. Res., 1998

1997

An open shop scheduling problem with a non-bottleneck machine.

Vitaly A. Strusevich, L. A. Hall

Oper. Res. Lett., 1997

Two-stage no-wait scheduling models with setup and removal times separated.

Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld

Comput. Oper. Res., 1997

Shop scheduling problems under precedence constraints.

Vitaly A. Strusevich

Ann. Oper. Res., 1997

1996

A New Heuristic for Three-Machine Flow Shop Scheduling.

Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich

Oper. Res., 1996

1995

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.

Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld

Oper. Res., 1995

Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.

Vitaly A. Strusevich

Discret. Appl. Math., 1995

1994

On non-permutation solutions to some two machine flow shop scheduling problems.

Vitaly A. Strusevich, Carin M. Zwaneveld

Math. Methods Oper. Res., 1994

1993

Approximation Algorithms for Three-Machine Open Shop Scheduling.

Bo Chen, Vitaly A. Strusevich

INFORMS J. Comput., 1993

Two machine open shop scheduling problem with setup, processing and removal times separated.

Vitaly A. Strusevich

Comput. Oper. Res., 1993