Vitaly A. Strusevich

According to our database1, Vitaly A. Strusevich authored at least 93 papers between 1993 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

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 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
Schedules with a single preemption on uniform parallel machines.
Discret. Appl. Math., 2019

2018
Models and algorithms for energy-efficient scheduling with immediate start of jobs.
J. Sched., 2018

The Block Retrieval Problem.
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

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

Single machine scheduling with a generalized job-dependent cumulative effect.
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
Single parameter analysis of power of preemption on two and three uniform machines.
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

Power of Preemption on Uniform Parallel Machines.
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

Parallel Machine Scheduling: Impact of Adding Extra Machines.
Oper. Res., 2013

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.
Eur. J. Oper. Res., 2013

An overview of computational issues in combinatorial optimization.
Ann. Oper. Res., 2013

2012
Scheduling with due date assignment under special conditions on job processing.
J. Sched., 2012

Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched., 2012

Editorial: new branches, old roots.
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
Hamiltonian properties of locally connected graphs with bounded vertex degree.
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

Scheduling incompatible tasks on two machines.
Eur. J. Oper. Res., 2010

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

Transporting Jobs through a Processing Center with Two Parallel Machines.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Fifty years of scheduling: a survey of milestones.
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 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

Guest Editorial.
Comput. Oper. Res., 2009

Operator non-availability periods.
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 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

On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
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

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

Planning Machine Maintenance in Two-Machine Shop Scheduling.
Oper. Res., 2006

Single machine scheduling with controllable release and processing parameters.
Discret. Appl. Math., 2006

2005
Pre-Emptive Scheduling Problems with Controllable Processing Times.
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.
Oper. Res. Lett., 2005

Two-machine flow shop scheduling problems with no-wait jobs.
Oper. Res. Lett., 2005

Two-machine shop scheduling: Compromise between flexibility and makespan value.
Eur. J. Oper. Res., 2005

Two-machine flow shop no-wait scheduling with machine maintenance.
4OR, 2005

2004
Scheduling with Due Date Assignment.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints.
J. Comb. Optim., 2004

Batching decisions for assembly production systems.
Eur. J. Oper. Res., 2004

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
Ann. Oper. Res., 2004

2003
Non-preemptive two-machine open shop scheduling with non-availability constraints.
Math. Methods Oper. Res., 2003

Scheduling parallel dedicated machines under a single non-shared resource.
Eur. J. Oper. Res., 2003

Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discret. Appl. Math., 2003

Preface: International Symposium on Combinatorial Optimisation.
Discret. Appl. Math., 2003

2002
Three-machine shop scheduling with partially ordered processing routes.
J. Oper. Res. Soc., 2002

2001
Two-machine open shop scheduling with an availability constraint.
Oper. Res. Lett., 2001

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
INFORMS J. Comput., 2001

Two-stage open shop scheduling with a bottleneck machine.
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 two-stage job shop scheduling problem with a bottleneck machine.
Eur. J. Oper. Res., 2000

1999
Two-machine open shop scheduling with special transportation times.
J. Oper. Res. Soc., 1999

A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times.
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

A polynomial algorithm for the three‐machineopen shop with a bottleneck machine.
Ann. Oper. Res., 1999

A heuristic algorithm for two-machine re-entrant shop scheduling.
Ann. Oper. Res., 1999

1998
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program., 1998

Heuristics for short route job shop scheduling problems.
Math. Methods Oper. Res., 1998

A greedy open shop heuristic with job priorities.
Ann. Oper. Res., 1998

1997
An open shop scheduling problem with a non-bottleneck machine.
Oper. Res. Lett., 1997

Two-stage no-wait scheduling models with setup and removal times separated.
Comput. Oper. Res., 1997

Shop scheduling problems under precedence constraints.
Ann. Oper. Res., 1997

1996
A New Heuristic for Three-Machine Flow Shop Scheduling.
Oper. Res., 1996

1995
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.
Oper. Res., 1995

Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds.
Discret. Appl. Math., 1995

1994
On non-permutation solutions to some two machine flow shop scheduling problems.
Math. Methods Oper. Res., 1994

1993
Approximation Algorithms for Three-Machine Open Shop Scheduling.
INFORMS J. Comput., 1993

Two machine open shop scheduling problem with setup, processing and removal times separated.
Comput. Oper. Res., 1993


  Loading...