Vitaly A. Strusevich
According to our database^{1},
Vitaly A. Strusevich
authored at least 93 papers
between 1993 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines.
Ann. Oper. Res., 2021
2020
Refined conditions for Vshaped 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 duewindow assignment with positiondependent processing times and job rejection.
4OR, 2020
2019
Discret. Appl. Math., 2019
2018
Models and algorithms for energyefficient scheduling with immediate start of jobs.
J. Sched., 2018
Eur. J. Oper. Res., 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
Twomachine flow shop and open shop scheduling problems with a single maintenance window.
Eur. J. Oper. Res., 2018
Approximation schemes for nonseparable nonlinear boolean programming problems under nested knapsack constraints.
Eur. J. Oper. Res., 2018
2017
Approximability issues for unconstrained and constrained maximization of halfproduct 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 halfproduct 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 halfproduct 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 timedependent linear deterioration and ratemodifying maintenance.
J. Oper. Res. Soc., 2015
2014
Single parameter analysis of power of preemption on two and three uniform machines.
Discret. Optim., 2014
An approximation algorithm for the threemachine 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
Preemptive scheduling on two identical parallel machines with a single transporter.
J. Comb. Optim., 2013
Oper. Res., 2013
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex HalfProduct.
Eur. J. Oper. Res., 2013
Ann. Oper. Res., 2013
2012
J. Sched., 2012
J. Sched., 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
The symmetric quadratic knapsack problem: approximation and scheduling applications.
4OR, 2012
2011
Discret. Appl. Math., 2011
2010
Minimizing Total Weighted earlinesstardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack.
Int. J. Found. Comput. Sci., 2010
Eur. J. Oper. Res., 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
J. Oper. Res. Soc., 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 nonavailability 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
Comput. Oper. Res., 2009
4OR, 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 DivideandConquer 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 TwoMachine 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
Oper. Res., 2006
Discret. Appl. Math., 2006
2005
J. Sched., 2005
Hans Kellerer, Ulrich Pferschy and David Pisinger, <i>Knapsack Problems</i>, Springer, Berlin (2004) ISBN 3540402861 546pp., EUR 99, 95.
Oper. Res. Lett., 2005
Oper. Res. Lett., 2005
Eur. J. Oper. Res., 2005
4OR, 2005
2004
Proceedings of the Handbook of Scheduling  Algorithms, Models, and Performance Analysis., 2004
J. Comb. Optim., 2004
Eur. J. Oper. Res., 2004
Ann. Oper. Res., 2004
2003
Nonpreemptive twomachine open shop scheduling with nonavailability constraints.
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 TwoMachine Flow and Open Shops.
INFORMS J. Comput., 2001
Eur. J. Oper. Res., 2001
2000
Group technology approach to the open shop scheduling problem with batch setup times.
Oper. Res. Lett., 2000
Heuristics for the twostage job shop scheduling problem with a bottleneck machine.
Eur. J. Oper. Res., 2000
1999
J. Oper. Res. Soc., 1999
J. Heuristics, 1999
A Heuristic for the Twomachine Openshop 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 twomachine flow shop scheduling with batch setup times.
Math. Program., 1998
Math. Methods Oper. Res., 1998
Ann. Oper. Res., 1998
1997
Oper. Res. Lett., 1997
Comput. Oper. Res., 1997
Ann. Oper. Res., 1997
1996
Oper. Res., 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