V. Strusevich

发表

Scheduling Theory: Multi-Stage Systems

V. S. Tanaev, I︠u︡. N. Sotskov, V. Strusevich, 1994 .

Single machine scheduling with general positional deterioration and rate-modifying maintenance

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2012 .

Convex and V-Shaped Sequences of Sums of Functions that Depend on Ceiling Functions

V. Strusevich, K. Rustogi, 2011 .

Fifty years of scheduling: a survey of milestones

Chris N. Potts, Vitaly A. Strusevich, C. Potts, 2009, J. Oper. Res. Soc..

Heuristics for short route job shop scheduling problems

Vitaly A. Strusevich, Inna G. Drobouchevitch, V. Strusevich, 1998, Math. Methods Oper. Res..

Scheduling parallel dedicated machines under a single non-shared resource

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2003, European Journal of Operational Research.

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2015, Math. Program..

International symposium on combinatoral optimisation

Vitaly A. Strusevich, Richard W. Eglese, Martin G. Everett, 2003 .

Speed Scaling for Scheduling Problems with Immediate Start of Jobs

N. V. Shakhlevich, V. Strusevich, A. Shioura, 2015 .

Approximation Schemes for Flow Shop Scheduling Problems with Machine Availabilty Constraints

Mikhail A. Kubzin, C. Potts, V. Strusevich, 2010 .

The symmetric quadratic knapsack problem: approximation and scheduling applications

H. Kellerer, V. Strusevich, 2011, 4OR.

Greenwich Academic Literature Archive (GALA)

V. Strusevich, Richard Quibell, 2016 .

Vyacheslav Tanaev: contributions to scheduling and related areas

V. Gordon, Y. Shafransky, Y. Sotskov, 2011, Journal of Scheduling.

Single machine scheduling with a generalized job-dependent cumulative effect

V. Strusevich, K. Rustogi, 2016, Journal of Scheduling.

Guest Editorial

Gerd Finke, Vitaly A. Strusevich, Frank Werner, 2009, Comput. Oper. Res..

Hamiltonian properties of locally connected graphs with bounded vertex degree

Chris N. Potts, Vitaly A. Strusevich, Yury L. Orlovich, 2011, Discret. Appl. Math..

Approximation scheduling algorithms: a survey

M Ya Kovalev, Ya. M Shafranskij, V. A Strusevich, 1989 .

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

Chris N. Potts, Luk N. Van Wassenhove, Vitaly A. Strusevich, 1995, Oper. Res..

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan

Chris N. Potts, Jatinder N. D. Gupta, Christos Koulamas, 2004, Ann. Oper. Res..

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Vitaly A. Strusevich, Bernhard Primas, Akiyoshi Shioura, 2017, Journal of Scheduling.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

Vitaly A. Strusevich, Valery S. Gordon, V. Gordon, 1997, Comput. Oper. Res..

Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches

V. Strusevich, 2022, Comput. Oper. Res..

Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Gur Mosheiov, Vitaly A. Strusevich, Assaf Sarig, 2018, 4OR.

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints

Hans Kellerer, Vitaly A. Strusevich, Nir Halman, 2018, Eur. J. Oper. Res..

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

Gur Mosheiov, Vitaly A. Strusevich, V. Strusevich, 2017 .

Scheduling with Due Date Assignment

Jean-Marie Proth, Vitaly A. Strusevich, Valery S. Gordon, 2004, Handbook of Scheduling.

Two-machine flow shop and open shop scheduling problems with a single maintenance window

Gur Mosheiov, Vitaly A. Strusevich, Jonathan Mosheiff, 2018, Eur. J. Oper. Res..

Models and Concepts of Classical Scheduling

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2017 .

Scheduling on Parallel Machines with Various Effects

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2017 .

Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times

Vitaly A. Strusevich, Natalia V. Shakhlevich, N. V. Shakhlevich, 2008, Algorithmica.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

Chris N. Potts, Vitaly A. Strusevich, Bo Chen, 1998, Math. Program..

A New Heuristic for Three-Machine Flow Shop Scheduling

Chris N. Potts, Celia A. Glass, Vitaly A. Strusevich, 1996, Oper. Res..

Worst-case analysis of heuristics for open shops with parallel machines

Vitaly A. Strusevich, Bo Chen, V. Strusevich, 1993 .

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2018, Eur. J. Oper. Res..

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2017, INFORMS J. Comput..

A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date

Hans Kellerer, Vitaly A. Strusevich, Kabir Rustogi, 2020 .

Two-machine open shop scheduling with an availability constraint

Vitaly A. Strusevich, Günter Schmidt, Joachim Breit, 2001, Oper. Res. Lett..

A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times

Vitaly A. Strusevich, V. Strusevich, 1999, Discret. Appl. Math..

Two-machine flow shop scheduling problems with no-wait jobs

Jean-Charles Billaut, Vitaly A. Strusevich, Mikhail A. Kubzin, 2005, Oper. Res. Lett..

Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds

Vitaly A. Strusevich, V. Strusevich, 1995, Discret. Appl. Math..

Simple matching vs linear assignment in scheduling models with positional effects: A critical review

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2012, Eur. J. Oper. Res..

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2010, Algorithmica.

Scheduling batches with simultaneous job processing for two-machine shop problems

Chris N. Potts, Vitaly A. Strusevich, Thomas Tautenhahn, 2001 .

Two-Machine Super-Shop Scheduling Problem

V. A. Strusevich, V. Strusevich, 1991 .

Approximation algorithms for makespan minimization on identical parallel machines under resource constraints

Vitaly A. Strusevich, V. Strusevich, 2020, J. Oper. Res. Soc..

Two-machine shop scheduling with an uncapacitated interstage transporter

Chung Yee Lee, Vitaly A. Strusevich, V. Strusevich, 2005 .

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

Chris N. Potts, Celia A. Glass, Vitaly A. Strusevich, 2001, INFORMS J. Comput..

Mathematical Optimization Theory and Operations Research: 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8 - 12, 2019, Revised Selected Papers

Krishna M. Sivalingam, Alfredo Cuzzocrea, Simone Diniz Junqueira Barbosa, 2019, MOTOR.

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead, 2008, J. Sched..

Preemptive and non-preemptive scheduling on two unrelated parallel machines

V. Strusevich, A. Soper, 2022, Journal of Scheduling.

Parametric analysis of the quality of single preemption schedules on three uniform parallel machines

Vitaly A. Strusevich, Alan Soper, V. Strusevich, 2018, Ann. Oper. Res..

Parametric analysis of the quality of single preemption schedules on three uniform parallel machines

V. Strusevich, A. Soper, 2018, Annals of Operations Research.

Scheduling with due date assignment under special conditions on job processing

V. Gordon, A. Dolgui, V. Strusevich, 2011, Journal of Scheduling.

Scheduling with due date assignment under special conditions on job processing

Alexandre Dolgui, Vitaly A. Strusevich, Valery S. Gordon, 2012, J. Sched..

Two-machine shop scheduling: Compromise between flexibility and makespan value

Jean-Charles Billaut, Vitaly A. Strusevich, Carl Esswein, 2005, Eur. J. Oper. Res..

Vyacheslav Tanaev: contributions to scheduling and related areas

Vitaly A. Strusevich, Mikhail Y. Kovalyov, Alexander V. Tuzikov, 2012, J. Sched..

Schedules with a single preemption on uniform parallel machines

Vitaly A. Strusevich, Alan J. Soper, V. Strusevich, 2019, Discret. Appl. Math..

Scheduling problems for parallel dedicated machines under multiple resource constraints

Hans Kellerer, Vitaly A. Strusevich, H. Kellerer, 2003, Discret. Appl. Math..

Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack

HANS KELLERER, VITALY A. STRUSEVICH, H. Kellerer, 2010, Int. J. Found. Comput. Sci..

Two-stage no-wait scheduling models with setup and removal times separated

Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld, 1997, Comput. Oper. Res..

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2016, INFORMS J. Comput..

Single Machine Scheduling with Controllable Processing Times by submodular Optimization

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2009, Int. J. Found. Comput. Sci..

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2008, ESA.

Scheduling Imprecise Computation Tasks on Parallel Machines to Minimize Linear and Non-Linear Error Penalties : Reviews , Links and Improvements

Vitaly A. Strusevich, Akiyoshi Shioura, Natalia V. Shakhlevich, 2015 .

The Block Retrieval Problem

Vitaly A. Strusevich, Maria Battarra, Günes Erdogan, 2018, Eur. J. Oper. Res..

Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2015, J. Oper. Res. Soc..

Two-stage no-wait scheduling models with setup and removal times separated

J. Gupta, V. Strusevich, C. Zwaneveld, 1997, Comput. Oper. Res..

Scheduling for Parallel Dedicated Machines with a Single Server

Celia A. Glass, Vitaly A. Strusevich, Yakov M. Shafransky, 2000 .

Two machine open shop scheduling problem with setup, processing and removal times separated

Vitaly A. Strusevich, V. Strusevich, 1993, Comput. Oper. Res..

An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order

Vitaly A. Strusevich, Richard Quibell, V. Strusevich, 2014, Comput. Ind. Eng..

Three-machine shop scheduling with partially ordered processing routes

Vitaly A. Strusevich, Natalia V. Shakhlevich, Inna G. Drobouchevitch, 2002, J. Oper. Res. Soc..

Group technology approach to the open shop scheduling problem with batch setup times

Vitaly A. Strusevich, V. Strusevich, 2000, Oper. Res. Lett..

Two-machine open shop scheduling with special transportation times

D Rebaine, Vitaly A. Strusevich, V. Strusevich, 1999, J. Oper. Res. Soc..

Parallel Machine Scheduling: Impact of Adding Extra Machines

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2013, Oper. Res..

Approximation results for flow shop scheduling problems with machine availability constraints

Chris N. Potts, Vitaly A. Strusevich, Mikhail A. Kubzin, 2009, Comput. Oper. Res..

Planning Machine Maintenance in Two-Machine Shop Scheduling

Vitaly A. Strusevich, Mikhail A. Kubzin, V. Strusevich, 2006, Oper. Res..

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

Vitaly A. Strusevich, Mikhail A. Kubzin, Günter Schmidt, 2006 .

Two-machine flow shop no-wait scheduling with machine maintenance

Vitaly A. Strusevich, Mikhail A. Kubzin, V. Strusevich, 2005, 4OR.

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

Vitaly A. Strusevich, Mikhail A. Kubzin, V. Strusevich, 2004 .

Non-preemptive two-machine open shop scheduling with non-availability constraints

Vitaly A. Strusevich, Günter Schmidt, Joachim Breit, 2003, Math. Methods Oper. Res..

Approximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval

Vitaly A. Strusevich, Mikhail A. Kubzin, V. Strusevich, 2002 .

Single machine scheduling with controllable release and processing parameters

Vitaly A. Strusevich, Natalia V. Shakhlevich, N. V. Shakhlevich, 2006, Discret. Appl. Math..

Batching decisions for assembly production systems

Chris N. Potts, Vitaly A. Strusevich, Mikhail Y. Kovalyov, 2004, Eur. J. Oper. Res..

The open shop scheduling problem with a given sequence of jobs on one machine

Vitaly A. Strusevich, Yakov M. Shafransky, Y. Shafransky, 1998 .

Single machine scheduling and due date assignment with positionally dependent processing times

Vitaly A. Strusevich, Valery S. Gordon, V. Gordon, 2009, Eur. J. Oper. Res..

Tanaev : contributions to scheduling and related areas

V. Gordon, Y. Shafransky, M. Kovalyov, 2011 .

Models and algorithms for energy-efficient scheduling with immediate start of jobs

N. V. Shakhlevich, V. Strusevich, A. Shioura, 2018, J. Sched..

Relevant Boolean Programming Problems

Vitaly A. Strusevich, Kabir Rustogi, V. Strusevich, 2017 .