Vitaly A. Strusevich

102 papers A 1Journal 96Unranked 3
YearRankTypeTitle / Venue / Authors
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
A historical note on the complexity of scheduling problems.
Oper. Res. Lett.
Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
2023 J jnl
An FPTAS for scheduling with resource constraints.
Oper. Res. Lett.
Bo Chen, Vitaly A. Strusevich
2023 J jnl
The two-flight low risk helicopter transportation problem under the split pickup scenario.
EURO J. Transp. Logist.
Hans Kellerer, Vitaly A. Strusevich
2022 J jnl
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches.
Comput. Oper. Res.
Vitaly A. Strusevich
2022 J jnl
Preemptive and non-preemptive scheduling on two unrelated parallel machines.
J. Sched.
Alan J. Soper, Vitaly A. Strusevich
2021 J jnl
Approximation algorithms for makespan minimization on identical parallel machines under resource constraints.
J. Oper. Res. Soc.
Vitaly A. Strusevich
2021 J jnl
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines.
Ann. Oper. Res.
Alan J. Soper, Vitaly A. Strusevich
2020 J jnl
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection.
4OR
Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich
2020 J jnl
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects.
J. Sched.
Alan J. Soper, Vitaly A. Strusevich
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 — ed.
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Revised Selected Papers
MOTOR (2)
Igor A. Bykadorov, Vitaly A. Strusevich, Tatiana V. Tchemisova
2019 J jnl
Schedules with a single preemption on uniform parallel machines.
Discret. Appl. Math.
Alan J. Soper, Vitaly A. Strusevich
2018 J jnl
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.
Eur. J. Oper. Res.
Nir Halman, Hans Kellerer, Vitaly A. Strusevich
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
2018 J jnl
The Block Retrieval Problem.
Eur. J. Oper. Res.
Marcos de Melo da Silva, Günes Erdogan, Maria Battarra, Vitaly A. Strusevich
2018 J jnl
Two-machine flow shop and open shop scheduling problems with a single maintenance window.
Eur. J. Oper. Res.
Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich, Jonathan Mosheiff
2017 J jnl
Approximability issues for unconstrained and constrained maximization of half-product related functions.
Theor. Comput. Sci.
Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich
2017 J jnl
Differential approximation schemes for half-product related functions and their scheduling applications.
Discret. Appl. Math.
Rebecca Sarto Basso, 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
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discret. Math.
Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
2017 J jnl
Single machine scheduling with a generalized job-dependent cumulative effect.
J. Sched.
Kabir Rustogi, Vitaly A. Strusevich
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 — conf
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization.
DOOR
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
2016 J jnl
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications.
Ann. Oper. Res.
Hans Kellerer, Vitaly A. Strusevich
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
2015 J jnl
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance.
J. Oper. Res. Soc.
Kabir Rustogi, Vitaly A. Strusevich
2014 J jnl
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order.
Comput. Ind. Eng.
Richard Quibell, Vitaly A. Strusevich
2014 — conf
Power of Preemption on Uniform Parallel Machines.
APPROX-RANDOM
Alan J. Soper, Vitaly A. Strusevich
2014 J jnl
Single parameter analysis of power of preemption on two and three uniform machines.
Discret. Optim.
Alan J. Soper, 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
An overview of computational issues in combinatorial optimization.
Ann. Oper. Res.
Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich
2013 J jnl
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.
J. Sched.
Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich
2013 J jnl
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.
Eur. J. Oper. Res.
Hans Kellerer, Vitaly A. Strusevich
2013 J jnl
Parallel Machine Scheduling: Impact of Adding Extra Machines.
Oper. Res.
Kabir Rustogi, Vitaly A. Strusevich
2013 J jnl
Preemptive scheduling on two identical parallel machines with a single transporter.
J. Comb. Optim.
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
2012 J jnl
Editorial: new branches, old roots.
J. Sched.
Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich
2012 J jnl
Scheduling with due date assignment under special conditions on job processing.
J. Sched.
Valery S. Gordon, Vitaly A. Strusevich, Alexandre Dolgui
2012 J jnl
Simple matching vs linear assignment in scheduling models with positional effects: A critical review.
Eur. J. Oper. Res.
Kabir Rustogi, Vitaly A. Strusevich
2012 J jnl
Single machine scheduling with precedence constraints and positionally dependent processing times.
Comput. Oper. Res.
Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich
2012 J jnl
The symmetric quadratic knapsack problem: approximation and scheduling applications.
4OR
Hans Kellerer, Vitaly A. Strusevich
2012 J jnl
Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched.
Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov
2011 J jnl
Hamiltonian properties of locally connected graphs with bounded vertex degree.
Discret. Appl. Math.
Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich
2010 J jnl
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.
Algorithmica
Hans Kellerer, Vitaly A. Strusevich
2010 J jnl
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack.
Int. J. Found. Comput. Sci.
Hans Kellerer, Vitaly A. Strusevich
2010 J jnl
Scheduling incompatible tasks on two machines.
Eur. J. Oper. Res.
Irina N. Lushchakova, Vitaly A. Strusevich
2010 — conf
Transporting Jobs through a Processing Center with Two Parallel Machines.
COCOA (1)
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
2009 J jnl
Approximation results for flow shop scheduling problems with machine availability constraints.
Comput. Oper. Res.
Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich
2009 J jnl
Fifty years of scheduling: a survey of milestones.
J. Oper. Res. Soc.
Chris N. Potts, Vitaly A. Strusevich
2009 J jnl
Guest Editorial.
Comput. Oper. Res.
Gerd Finke, Vitaly A. Strusevich, Frank Werner
2009 J jnl
Operator non-availability periods.
4OR
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
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
2009 J jnl
Single machine scheduling and due date assignment with positionally dependent processing times.
Eur. J. Oper. Res.
Valery S. Gordon, Vitaly A. Strusevich
2009 J jnl
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval.
Eur. J. Oper. Res.
Hans Kellerer, Mikhail A. Kubzin, 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
2008 J jnl
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.
J. Sched.
Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead
2007 J jnl
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter.
Int. J. Found. Comput. Sci.
Alan J. Soper, Vitaly A. Strusevich
2007 J jnl
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
Electron. Notes Discret. Math.
Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich
2006 J jnl
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.
Theor. Comput. Sci.
Hans Kellerer, Vitaly A. Strusevich
2006 J jnl
Planning Machine Maintenance in Two-Machine Shop Scheduling.
Oper. Res.
Mikhail A. Kubzin, Vitaly A. Strusevich
2006 J jnl
Single machine scheduling with controllable release and processing parameters.
Discret. Appl. Math.
Natalia V. Shakhlevich, Vitaly A. Strusevich
2006 J jnl
Three is easy, two is hard: open shop sum-batch scheduling problem refined.
Oper. Res. Lett.
Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra
2005 J jnl
Hans Kellerer, Ulrich Pferschy and David Pisinger,
Oper. Res. Lett.
Vitaly A. Strusevich
2005 J jnl
Pre-Emptive Scheduling Problems with Controllable Processing Times.
J. Sched.
Natalia V. Shakhlevich, Vitaly A. Strusevich
2005 J jnl
Two-machine flow shop no-wait scheduling with machine maintenance.
4OR
Mikhail A. Kubzin, Vitaly A. Strusevich
2005 J jnl
Two-machine flow shop scheduling problems with no-wait jobs.
Oper. Res. Lett.
Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich
2005 J jnl
Two-machine shop scheduling: Compromise between flexibility and makespan value.
Eur. J. Oper. Res.
Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich
2004 J jnl
Batching decisions for assembly production systems.
Eur. J. Oper. Res.
Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
2004 J jnl
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints.
J. Comb. Optim.
Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich
2004 J jnl
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
Ann. Oper. Res.
Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich
2004 — ch.
Scheduling with Due Date Assignment.
Handbook of Scheduling
Valery S. Gordon, Jean-Marie Proth, Vitaly A. Strusevich
2003 J jnl
Non-preemptive two-machine open shop scheduling with non-availability constraints.
Math. Methods Oper. Res.
Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
2003 J jnl
Preface: International Symposium on Combinatorial Optimisation.
Discret. Appl. Math.
Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich
2003 J jnl
Scheduling parallel dedicated machines under a single non-shared resource.
Eur. J. Oper. Res.
Hans Kellerer, Vitaly A. Strusevich
2003 J jnl
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discret. Appl. Math.
Hans Kellerer, Vitaly A. Strusevich
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
2001 J jnl
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
INFORMS J. Comput.
Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
2001 J jnl
Two-machine open shop scheduling with an availability constraint.
Oper. Res. Lett.
Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
2001 J jnl
Two-stage open shop scheduling with a bottleneck machine.
Eur. J. Oper. Res.
Inna G. Drobouchevitch, Vitaly A. Strusevich
2000 J jnl
Group technology approach to the open shop scheduling problem with batch setup times.
Oper. Res. Lett.
Vitaly A. Strusevich
2000 J jnl
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine.
Eur. J. Oper. Res.
Inna G. Drobouchevitch, Vitaly A. Strusevich
1999 J jnl
A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times.
J. Heuristics
Vitaly A. Strusevich, A. J. A. van de Waart, Rommert Dekker
1999 J jnl
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.
Discret. Appl. Math.
Vitaly A. Strusevich
1999 J jnl
A heuristic algorithm for two-machine re-entrant shop scheduling.
Ann. Oper. Res.
Inna G. Drobouchevitch, Vitaly A. Strusevich
1999 J jnl
A polynomial algorithm for the three‐machineopen shop with a bottleneck machine.
Ann. Oper. Res.
Inna G. Drobouchevitch, Vitaly A. Strusevich
1999 J jnl
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment.
Comput. Oper. Res.
Valery S. Gordon, Vitaly A. Strusevich
1999 J jnl
Two-machine open shop scheduling with special transportation times.
J. Oper. Res. Soc.
Djamal Rebaine, Vitaly A. Strusevich
1998 J jnl
A greedy open shop heuristic with job priorities.
Ann. Oper. Res.
Vitaly A. Strusevich
1998 J jnl
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program.
Bo Chen, Chris N. Potts, Vitaly A. Strusevich
1998 J jnl
Heuristics for short route job shop scheduling problems.
Math. Methods Oper. Res.
Inna G. Drobouchevitch, Vitaly A. Strusevich
1997 J jnl
An open shop scheduling problem with a non-bottleneck machine.
Oper. Res. Lett.
Vitaly A. Strusevich, L. A. Hall
1997 J jnl
Shop scheduling problems under precedence constraints.
Ann. Oper. Res.
Vitaly A. Strusevich
1997 J jnl
Two-stage no-wait scheduling models with setup and removal times separated.
Comput. Oper. Res.
Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld
1996 J jnl
A New Heuristic for Three-Machine Flow Shop Scheduling.
Oper. Res.
Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
1995 J jnl
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.
Oper. Res.
Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld
1995 J jnl
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.
Discret. Appl. Math.
Vitaly A. Strusevich
1994 J jnl
On non-permutation solutions to some two machine flow shop scheduling problems.
Math. Methods Oper. Res.
Vitaly A. Strusevich, Carin M. Zwaneveld
1993 J jnl
Approximation Algorithms for Three-Machine Open Shop Scheduling.
INFORMS J. Comput.
Bo Chen, Vitaly A. Strusevich
1993 J jnl
Two machine open shop scheduling problem with setup, processing and removal times separated.
Comput. Oper. Res.
Vitaly A. Strusevich