Vitaly A. Strusevich

From MaRDI portal
Person:217074

Available identifiers

zbMath Open strusevich.vitaly-aWikidataQ102256386 ScholiaQ102256386MaRDI QIDQ217074

List of research outcomes

PublicationDate of PublicationType
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques2024-03-15Paper
An FPTAS for scheduling with resource constraints2023-09-12Paper
A historical note on the complexity of scheduling problems2023-06-27Paper
Preemptive and non-preemptive scheduling on two unrelated parallel machines2022-11-04Paper
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches2022-06-22Paper
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection2021-05-20Paper
Parametric analysis of the quality of single preemption schedules on three uniform parallel machines2021-05-05Paper
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects2020-12-11Paper
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints2020-11-09Paper
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost2020-04-21Paper
Models and algorithms for energy-efficient scheduling with immediate start of jobs2019-08-08Paper
Schedules with a single preemption on uniform parallel machines2019-05-17Paper
Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow2019-05-02Paper
Two-machine flow shop and open shop scheduling problems with a single maintenance window2018-07-25Paper
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints2018-07-12Paper
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches2018-05-30Paper
Single machine scheduling with a generalized job-dependent cumulative effect2018-02-28Paper
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization2018-02-13Paper
The block retrieval problem2017-11-23Paper
https://portal.mardi4nfdi.de/entity/Q29696342017-03-22Paper
Scheduling with time-changing effects and rate-modifying activities2017-03-02Paper
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines2017-01-27Paper
Approximability issues for unconstrained and constrained maximization of half-product related functions2016-12-23Paper
Differential approximation schemes for half-product related functions and their scheduling applications2016-12-22Paper
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications2016-07-22Paper
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines2016-05-19Paper
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product2016-03-15Paper
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times2015-10-19Paper
Single parameter analysis of power of preemption on two and three uniform machines2015-04-09Paper
Parallel Machine Scheduling: Impact of Adding Extra Machines2014-06-26Paper
Scheduling with due date assignment under special conditions on job processing2014-02-05Paper
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance2014-02-05Paper
https://portal.mardi4nfdi.de/entity/Q28374622013-07-10Paper
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines2013-06-27Paper
Preemptive scheduling on two identical parallel machines with a single transporter2013-03-25Paper
The symmetric quadratic knapsack problem: approximation and scheduling applications2013-02-06Paper
Simple matching vs linear assignment in scheduling models with positional effects: a critical review2012-12-29Paper
Single machine scheduling with precedence constraints and positionally dependent processing times2012-11-15Paper
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops2012-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31099472012-01-26Paper
Hamiltonian properties of locally connected graphs with bounded vertex degree2011-10-27Paper
Scheduling parallel dedicated machines with the speeding‐up resource2011-04-15Paper
On Single Machine Scheduling and Due DateAssignment with Positionally Dependent Processing Times2011-04-07Paper
https://portal.mardi4nfdi.de/entity/Q30760932011-02-17Paper
Transporting Jobs through a Processing Center with Two Parallel Machines2011-01-08Paper
Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary2011-01-03Paper
https://portal.mardi4nfdi.de/entity/Q31613622010-10-14Paper
MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK2010-06-18Paper
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications2010-05-28Paper
Scheduling incompatible tasks on two machines2009-12-14Paper
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval2009-12-07Paper
Operator non-availability periods2009-12-02Paper
Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation2009-08-28Paper
Fifty years of scheduling: a survey of milestones2009-08-28Paper
Planning Machine Maintenance in Two-Machine Shop Scheduling2009-08-13Paper
Single machine scheduling and due date assignment with positionally dependent processing times2009-06-30Paper
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION2009-06-23Paper
Transporting jobs through a two‐machine open shop2009-04-22Paper
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach2008-11-25Paper
Approximation results for flow shop scheduling problems with machine availability constraints2008-11-07Paper
Preemptive scheduling on uniform parallel machines with controllable job processing times2008-07-01Paper
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints2008-06-05Paper
Three is easy, two is hard: Open shop sum-batch scheduling problem refined2008-01-15Paper
AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER2007-06-05Paper
Pre-emptive scheduling problems with controllable processing times2007-05-15Paper
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints2007-02-20Paper
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date2007-01-09Paper
Single machine scheduling with controllable release and processing parameters2006-10-30Paper
Two-machine flow shop no-wait scheduling with machine maintenance2006-10-11Paper
Single machine scheduling and due date assignment under series-parallel precedence constraints2006-06-12Paper
Two-machine shop scheduling: Compromise between flexibility and makespan value2005-09-28Paper
Two-machine flow shop scheduling problems with no-wait jobs2005-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46670872005-04-19Paper
Three-machine shop scheduling with partially ordered processing routes2005-03-14Paper
Two-machine open shop scheduling with special transportation times2005-01-13Paper
Batching decisions for assembly production systems2005-01-12Paper
Two-machine flow shop no-wait scheduling with a nonavailability interval2005-01-11Paper
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan2004-08-10Paper
Scheduling problems for parallel dedicated machines under multiple resource constraints.2004-01-05Paper
Non-preemptive two-machine open shop scheduling with non-availability constraints2003-06-26Paper
Scheduling parallel dedicated machines under a single non-shared resource2003-04-28Paper
Scheduling batches with simultaneous job processing for two-machine shop problems2002-02-27Paper
Two-machine open shop scheduling with an availability constraint2001-12-05Paper
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine2001-09-03Paper
Two-stage open shop scheduling with a bottleneck machine2001-01-25Paper
Group technology approach to the open shop scheduling problem with batch setup times2000-11-22Paper
A heuristic for the two-machine open-shop scheduling problem with transportation times2000-08-07Paper
https://portal.mardi4nfdi.de/entity/Q44887822000-07-09Paper
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment2000-05-11Paper
Heuristics for short route job shop scheduling problems2000-01-18Paper
A polynomial algorithm for the three-machine open shop with a bottleneck machine2000-01-11Paper
A 3/2 algorithm for two-machine open shop with route-dependent processing times1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42465401999-08-03Paper
A heuristic algorithm for two-machine re-entrant shop scheduling1999-06-10Paper
Approximation algorithms for two-machine flow shop scheduling with batch setup times1999-06-03Paper
A greedy open shop heuristic with job priorities1998-12-06Paper
Two-stage no-wait scheduling models with setup and removal times separated1998-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43362131998-04-22Paper
Shop scheduling problems under precedence constraints1998-02-05Paper
An open shop scheduling problem with a non-bottleneck machine1997-11-06Paper
A New Heuristic for Three-Machine Flow Shop Scheduling1997-08-03Paper
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation1995-09-25Paper
https://portal.mardi4nfdi.de/entity/Q48415791995-08-08Paper
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds1995-05-17Paper
On non-permutation solutions to some two machine flow shop scheduling problems1994-08-15Paper
Optimal job-shop scheduling with two jobs in systems with unrestricted paths1994-07-06Paper
https://portal.mardi4nfdi.de/entity/Q42888321994-04-20Paper
Approximation Algorithms for Three-Machine Open Shop Scheduling1994-03-24Paper
Worst-case analysis of heuristics for open shops with parallel machines1993-12-20Paper
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q31382701993-12-20Paper
Two machine open shop scheduling problem with setup, processing and removal times separated1993-08-10Paper
Inhomogeneous deterministic two-stage queueing systems1992-09-27Paper
Optimal choice of machine speeds for two-stage non-homogeneous systems1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40123441992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40123451992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39946871992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39807091992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39730851992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39730861992-06-26Paper
Two-Machine Super-Shop Scheduling Problem1992-06-25Paper
Approximation scheduling algorithms: a survey1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30335461989-01-01Paper
Two-stage queueing systems with resource constraints and without prescribed flow paths1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38240941989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42077761988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37389031986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37513601986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37456061985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47425391982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39395841981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vitaly A. Strusevich