Vitaly A. Strusevich
Orcid: 0000-0002-4602-8573
According to our database1,
Vitaly A. Strusevich
authored at least 101 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Preemptive scheduling of parallel jobs of two sizes with controllable processing times.
J. Sched., April, 2024
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques.
Networks, April, 2024
2023
Oper. Res. Lett., January, 2023
The two-flight low risk helicopter transportation problem under the split pickup scenario.
EURO J. Transp. Logist., 2023
2022
J. Sched., 2022
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches.
Comput. Oper. Res., 2022
2021
Approximation algorithms for makespan minimization on identical parallel machines under resource constraints.
J. Oper. Res. Soc., 2021
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines.
Ann. Oper. Res., 2021
2020
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects.
J. Sched., 2020
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost.
J. Glob. Optim., 2020
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection.
4OR, 2020
2019
Discret. Appl. Math., 2019
2018
J. Sched., 2018
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches.
Eur. J. Oper. Res., 2018
Two-machine flow shop and open shop scheduling problems with a single maintenance window.
Eur. J. Oper. Res., 2018
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.
Eur. J. Oper. Res., 2018
2017
Approximability issues for unconstrained and constrained maximization of half-product related functions.
Theor. Comput. Sci., 2017
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discret. Math., 2017
J. Sched., 2017
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints.
INFORMS J. Comput., 2017
Differential approximation schemes for half-product related functions and their scheduling applications.
Discret. Appl. Math., 2017
2016
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines.
INFORMS J. Comput., 2016
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications.
Ann. Oper. Res., 2016
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization.
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.
Math. Program., 2015
Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance.
J. Oper. Res. Soc., 2015
2014
Discret. Optim., 2014
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order.
Comput. Ind. Eng., 2014
Proceedings of the Approximation, 2014
2013
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines.
SIAM J. Discret. Math., 2013
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.
J. Sched., 2013
J. Comb. Optim., 2013
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.
Eur. J. Oper. Res., 2013
Ann. Oper. Res., 2013
2012
J. Sched., 2012
Simple matching vs linear assignment in scheduling models with positional effects: A critical review.
Eur. J. Oper. Res., 2012
Single machine scheduling with precedence constraints and positionally dependent processing times.
Comput. Oper. Res., 2012
4OR, 2012
2011
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.
Int. J. Found. Comput. Sci., 2010
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.
Algorithmica, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
2009
Single Machine Scheduling with Controllable Processing Times by submodular Optimization.
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.
Eur. J. Oper. Res., 2009
Single machine scheduling and due date assignment with positionally dependent processing times.
Eur. J. Oper. Res., 2009
Approximation results for flow shop scheduling problems with machine availability constraints.
Comput. Oper. Res., 2009
2008
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.
J. Sched., 2008
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.
Algorithmica, 2008
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.
Proceedings of the Algorithms, 2008
2007
An Improved Approximation Algorithm for the Two-Machine Flow Shop Scheduling Problem with an interstage transporter.
Int. J. Found. Comput. Sci., 2007
Electron. Notes Discret. Math., 2007
2006
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.
Theor. Comput. Sci., 2006
Oper. Res. Lett., 2006
Discret. Appl. Math., 2006
2005
Hans Kellerer, Ulrich Pferschy and David Pisinger, <i>Knapsack Problems</i>, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95.
Oper. Res. Lett., 2005
Eur. J. Oper. Res., 2005
2004
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
J. Comb. Optim., 2004
Ann. Oper. Res., 2004
2003
Math. Methods Oper. Res., 2003
Eur. J. Oper. Res., 2003
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
2002
J. Oper. Res. Soc., 2002
2001
Oper. Res. Lett., 2001
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
INFORMS J. Comput., 2001
2000
Group technology approach to the open shop scheduling problem with batch setup times.
Oper. Res. Lett., 2000
Eur. J. Oper. Res., 2000
1999
J. Oper. Res. Soc., 1999
J. Heuristics, 1999
A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times.
Discret. Appl. Math., 1999
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment.
Comput. Oper. Res., 1999
Ann. Oper. Res., 1999
Ann. Oper. Res., 1999
1998
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program., 1998
Math. Methods Oper. Res., 1998
1997
Oper. Res. Lett., 1997
Comput. Oper. Res., 1997
1996
1995
Oper. Res., 1995
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.
Discret. Appl. Math., 1995
1994
Math. Methods Oper. Res., 1994
1993
INFORMS J. Comput., 1993
Two machine open shop scheduling problem with setup, processing and removal times separated.
Comput. Oper. Res., 1993