Vitaly A. Strusevich

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 28

Top Venues

Publications

Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Preemptive scheduling of parallel jobs of two sizes with controllable processing times. J. Sched. 27 (2) (2024)
Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. Networks 83 (3) (2024)
Bo Chen, Vitaly A. Strusevich
An FPTAS for scheduling with resource constraints. Oper. Res. Lett. 51 (4) (2023)
Hans Kellerer, Vitaly A. Strusevich
The two-flight low risk helicopter transportation problem under the split pickup scenario. EURO J. Transp. Logist. 12 (2023)
Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
A historical note on the complexity of scheduling problems. Oper. Res. Lett. 51 (1) (2023)
Alan J. Soper, Vitaly A. Strusevich
Preemptive and non-preemptive scheduling on two unrelated parallel machines. J. Sched. 25 (6) (2022)
Vitaly A. Strusevich
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches. Comput. Oper. Res. 144 (2022)
Alan J. Soper, Vitaly A. Strusevich
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines. Ann. Oper. Res. 298 (1) (2021)
Vitaly A. Strusevich
Approximation algorithms for makespan minimization on identical parallel machines under resource constraints. J. Oper. Res. Soc. 72 (9) (2021)
Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18 (4) (2020)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim. 76 (3) (2020)
Alan J. Soper, Vitaly A. Strusevich
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects. J. Sched. 23 (6) (2020)
Alan J. Soper, Vitaly A. Strusevich
Schedules with a single preemption on uniform parallel machines. Discret. Appl. Math. 261 (2019)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. Eur. J. Oper. Res. 266 (3) (2018)
Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich, Jonathan Mosheiff
Two-machine flow shop and open shop scheduling problems with a single maintenance window. Eur. J. Oper. Res. 271 (2) (2018)
Nir Halman, Hans Kellerer, Vitaly A. Strusevich
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. Eur. J. Oper. Res. 270 (2) (2018)
Marcos de Melo da Silva, Günes Erdogan, Maria Battarra, Vitaly A. Strusevich
The Block Retrieval Problem. Eur. J. Oper. Res. 265 (3) (2018)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich, Bernhard Primas
Models and algorithms for energy-efficient scheduling with immediate start of jobs. J. Sched. 21 (5) (2018)
Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. 31 (1) (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints. INFORMS J. Comput. 29 (4) (2017)
Rebecca Sarto Basso, Vitaly A. Strusevich
Differential approximation schemes for half-product related functions and their scheduling applications. Discret. Appl. Math. 217 (2017)
Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich
Approximability issues for unconstrained and constrained maximization of half-product related functions. Theor. Comput. Sci. 659 (2017)
Kabir Rustogi, Vitaly A. Strusevich
Single machine scheduling with a generalized job-dependent cumulative effect. J. Sched. 20 (6) (2017)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. DOOR (2016)
Hans Kellerer, Vitaly A. Strusevich
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann. Oper. Res. 240 (1) (2016)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines. INFORMS J. Comput. 28 (1) (2016)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153 (2) (2015)
Kabir Rustogi, Vitaly A. Strusevich
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance. J. Oper. Res. Soc. 66 (3) (2015)
Alan J. Soper, Vitaly A. Strusevich
Single parameter analysis of power of preemption on two and three uniform machines. Discret. Optim. 12 (2014)
Alan J. Soper, Vitaly A. Strusevich
Power of Preemption on Uniform Parallel Machines. APPROX-RANDOM (2014)
Richard Quibell, Vitaly A. Strusevich
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order. Comput. Ind. Eng. 76 (2014)
Laureano F. Escudero, Silvano Martello, Vitaly A. Strusevich
An overview of computational issues in combinatorial optimization. Ann. Oper. Res. 207 (1) (2013)
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25 (2) (2013)
Hans Kellerer, Vitaly A. Strusevich
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. Eur. J. Oper. Res. 228 (1) (2013)
Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. J. Sched. 16 (6) (2013)
Kabir Rustogi, Vitaly A. Strusevich
Parallel Machine Scheduling: Impact of Adding Extra Machines. Oper. Res. 61 (5) (2013)
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. SIAM J. Discret. Math. 27 (1) (2013)
Alexandre Dolgui, Valery S. Gordon, Vitaly A. Strusevich
Single machine scheduling with precedence constraints and positionally dependent processing times. Comput. Oper. Res. 39 (6) (2012)
Hans Kellerer, Vitaly A. Strusevich
The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10 (2) (2012)
Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich
Editorial: new branches, old roots. J. Sched. 15 (4) (2012)
Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov
Vyacheslav Tanaev: contributions to scheduling and related areas. J. Sched. 15 (4) (2012)
Kabir Rustogi, Vitaly A. Strusevich
Simple matching vs linear assignment in scheduling models with positional effects: A critical review. Eur. J. Oper. Res. 222 (3) (2012)
Valery S. Gordon, Vitaly A. Strusevich, Alexandre Dolgui
Scheduling with due date assignment under special conditions on job processing. J. Sched. 15 (4) (2012)
Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich
Hamiltonian properties of locally connected graphs with bounded vertex degree. Discret. Appl. Math. 159 (16) (2011)
Irina N. Lushchakova, Vitaly A. Strusevich
Scheduling incompatible tasks on two machines. Eur. J. Oper. Res. 200 (2) (2010)
Hans Kellerer, Vitaly A. Strusevich
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57 (4) (2010)
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) (2010)
Hans Kellerer, Vitaly A. Strusevich
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. 21 (3) (2010)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
Operator non-availability periods. 4OR 7 (3) (2009)
Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich
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. 199 (1) (2009)
Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich
Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36 (2) (2009)
Valery S. Gordon, Vitaly A. Strusevich
Single machine scheduling and due date assignment with positionally dependent processing times. Eur. J. Oper. Res. 198 (1) (2009)
Gerd Finke, Vitaly A. Strusevich, Frank Werner
Guest Editorial. Comput. Oper. Res. 36 (2) (2009)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Single Machine Scheduling with Controllable Processing Times by submodular Optimization. Int. J. Found. Comput. Sci. 20 (2) (2009)
Chris N. Potts, Vitaly A. Strusevich
Fifty years of scheduling: a survey of milestones. J. Oper. Res. Soc. 60 (S1) (2009)
Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J. Sched. 11 (5) (2008)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. Algorithmica 51 (4) (2008)
Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. ESA (2008)
Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. Electron. Notes Discret. Math. 29 (2007)
Alan J. Soper, Vitaly A. Strusevich
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter. Int. J. Found. Comput. Sci. 18 (3) (2007)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154 (15) (2006)
Mikhail A. Kubzin, Vitaly A. Strusevich
Planning Machine Maintenance in Two-Machine Shop Scheduling. Oper. Res. 54 (4) (2006)
Hans Kellerer, Vitaly A. Strusevich
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor. Comput. Sci. 369 (1-3) (2006)
Irina V. Gribkovskaia, Chung-Yee Lee, Vitaly A. Strusevich, Dominique de Werra
Three is easy, two is hard: open shop sum-batch scheduling problem refined. Oper. Res. Lett. 34 (4) (2006)
Mikhail A. Kubzin, Vitaly A. Strusevich
Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3 (4) (2005)
Vitaly A. Strusevich
, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. Oper. Res. Lett. 33 (2) (2005)
Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich
Two-machine flow shop scheduling problems with no-wait jobs. Oper. Res. Lett. 33 (3) (2005)
Natalia V. Shakhlevich, Vitaly A. Strusevich
Pre-Emptive Scheduling Problems with Controllable Processing Times. J. Sched. 8 (3) (2005)
Carl Esswein, Jean-Charles Billaut, Vitaly A. Strusevich
Two-machine shop scheduling: Compromise between flexibility and makespan value. Eur. J. Oper. Res. 167 (3) (2005)
Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Ann. Oper. Res. 129 (1-4) (2004)
Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. J. Comb. Optim. 8 (1) (2004)
Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
Batching decisions for assembly production systems. Eur. J. Oper. Res. 157 (3) (2004)
Hans Kellerer, Vitaly A. Strusevich
Scheduling parallel dedicated machines under a single non-shared resource. Eur. J. Oper. Res. 147 (2) (2003)
Hans Kellerer, Vitaly A. Strusevich
Scheduling problems for parallel dedicated machines under multiple resource constraints. Discret. Appl. Math. 133 (1-3) (2003)
Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57 (2) (2003)
Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich
Preface: International Symposium on Combinatorial Optimisation. Discret. Appl. Math. 133 (1-3) (2003)
Vitaly A. Strusevich, Inna G. Drobouchevitch, Natalia V. Shakhlevich
Three-machine shop scheduling with partially ordered processing routes. J. Oper. Res. Soc. 53 (5) (2002)
Inna G. Drobouchevitch, Vitaly A. Strusevich
Two-stage open shop scheduling with a bottleneck machine. Eur. J. Oper. Res. 128 (1) (2001)
Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS J. Comput. 13 (2) (2001)
Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29 (2) (2001)
Vitaly A. Strusevich
Group technology approach to the open shop scheduling problem with batch setup times. Oper. Res. Lett. 26 (4) (2000)
Inna G. Drobouchevitch, Vitaly A. Strusevich
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine. Eur. J. Oper. Res. 123 (2) (2000)
Vitaly A. Strusevich
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times. Discret. Appl. Math. 93 (2-3) (1999)
Djamal Rebaine, Vitaly A. Strusevich
Two-machine open shop scheduling with special transportation times. J. Oper. Res. Soc. 50 (7) (1999)
Valery S. Gordon, Vitaly A. Strusevich
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Comput. Oper. Res. 26 (2) (1999)
Inna G. Drobouchevitch, Vitaly A. Strusevich
A heuristic algorithm for two-machine re-entrant shop scheduling. Ann. Oper. Res. 86 (1999)
Inna G. Drobouchevitch, Vitaly A. Strusevich
A polynomial algorithm for the three‐machineopen shop with a bottleneck machine. Ann. Oper. Res. 92 (1999)
Vitaly A. Strusevich, A. J. A. van de Waart, Rommert Dekker
A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times. J. Heuristics 5 (1) (1999)
Bo Chen, Chris N. Potts, Vitaly A. Strusevich
Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Program. 82 (1998)
Inna G. Drobouchevitch, Vitaly A. Strusevich
Heuristics for short route job shop scheduling problems. Math. Methods Oper. Res. 48 (3) (1998)
Vitaly A. Strusevich
A greedy open shop heuristic with job priorities. Ann. Oper. Res. 83 (1998)
Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld
Two-stage no-wait scheduling models with setup and removal times separated. Comput. Oper. Res. 24 (11) (1997)
Vitaly A. Strusevich
Shop scheduling problems under precedence constraints. Ann. Oper. Res. 69 (1997)
Vitaly A. Strusevich, L. A. Hall
An open shop scheduling problem with a non-bottleneck machine. Oper. Res. Lett. 21 (1) (1997)
Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
A New Heuristic for Three-Machine Flow Shop Scheduling. Oper. Res. 44 (6) (1996)
Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation. Oper. Res. 43 (2) (1995)
Vitaly A. Strusevich
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. Discret. Appl. Math. 59 (1) (1995)
Vitaly A. Strusevich, Carin M. Zwaneveld
On non-permutation solutions to some two machine flow shop scheduling problems. Math. Methods Oper. Res. 39 (3) (1994)
Vitaly A. Strusevich
Two machine open shop scheduling problem with setup, processing and removal times separated. Comput. Oper. Res. 20 (6) (1993)
Bo Chen, Vitaly A. Strusevich
Approximation Algorithms for Three-Machine Open Shop Scheduling. INFORMS J. Comput. 5 (3) (1993)

Vitaly A. Strusevich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vitaly A. Strusevich