World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
4323
World Ranking
11813
National Ranking
747

Mathematics

D-Index
35
Citations
4215
World Ranking
2814
National Ranking
183

Overview

Vitaly A. Strusevich is affiliated with the University of Greenwich in the United Kingdom. Their research spans the intersecting fields of Engineering and Computer Science, with a particular focus on Industrial and Manufacturing Engineering and Computer Networks and Communications.

The scientist's main research topics include Scheduling and Optimization Algorithms, Optimization and Search Problems, Advanced Manufacturing and Logistics Optimization, Optimization and Packing Problems, Assembly Line Balancing Optimization, Distributed and Parallel Computing Systems, and Interconnection Networks and Systems.

Vitaly A. Strusevich has contributed to several publications in notable academic venues. Frequent publication venues include:

  • Journal of Scheduling
  • Operations Research Letters
  • Computers & Operations Research
  • Journal of the Operational Research Society
  • EURO Journal on Transportation and Logistics

The scientist's recent papers encompass a variety of scheduling and optimization challenges. Key papers are:

  • Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches, 2022, Computers & Operations Research
  • Approximation algorithms for makespan minimization on identical parallel machines under resource constraints, 2020, Journal of the Operational Research Society
  • Preemptive and non-preemptive scheduling on two unrelated parallel machines, 2022, Journal of Scheduling
  • Preemptive scheduling of parallel jobs of two sizes with controllable processing times, 2023, Journal of Scheduling
  • A historical note on the complexity of scheduling problems, 2022, Operations Research Letters

Collaborations have been established with several researchers across these studies. Frequent co-authors include:

  • Akiyoshi Shioura
  • Natalia V. Shakhlevich
  • Alan Soper
  • Jan Karel Lenstra
  • Milan Vlach

The scientist applies advanced methods in optimization and scheduling algorithms, engaging with both theoretical and applied aspects across manufacturing and computing systems. Their work addresses complex problems such as makespan minimization, resource-constrained scheduling, and parallel processing job management.

Best Publications

  • The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

    C. N. Potts;S. V. Sevast'janov;V. A. Strusevich;L. N. Van Wassenhove

  • Fifty years of scheduling: a survey of milestones

    Christopher N. Potts;Vitaly A. Strusevich

  • Planning Machine Maintenance in Two-machine Shop Scheduling

    Mikhail A. Kubzin;Vitaly A. Strusevich

  • Scheduling Theory: Multi-Stage Systems

    Unknown

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

    V. S. Gordon;C. N. Potts;V. A. Strusevich;J. D. Whitehead

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

    Hans Kellerer;Vitaly A. Strusevich

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

    Valery S. Gordon;Vitaly A. Strusevich

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

    Kabir Rustogi;Vitaly A. Strusevich

  • Scheduling for Parallel Dedicated Machines with a Single Server

    Celia A. Glass;Yakov M. Shafransky;Vitaly A. Strusevich

  • Approximation Algorithms for Three-Machine Open Shop Scheduling

    Bo Chen;Vitaly A. Strusevich

  • A heuristic for two-machine open-shop scheduling problem with transportation times

    V. A. Strusevich

  • Scheduling with Time-Changing Effects and Rate-Modifying Activities

    Vitaly A. Strusevich;Kabir Rustogi

  • Scheduling with due date assignment under special conditions on job processing

    Valery Gordon;Vitaly Strusevich;Alexandre Dolgui

  • Scheduling problems for parallel dedicated machines under multiple resource constraints

    H. Kellerer;V. A. Strusevich

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

    Mikhail A. Kubzin;Vitaly A. Strusevich

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

    C. N. Potts;V. A. Strusevich;T. Tautenhahn

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

    C.A. Glass;C.N. Potts;V.A. Strusevich

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

    Kabir Rustogi;Vitaly A. Strusevich

  • Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter

    Chung Yee Lee;Vitaly A. Strusevich

  • Combining time and position dependent effects on a single machine subject to rate-modifying activities

    Kabir Rustogi;Vitaly A. Strusevich

  • A New Heuristic for Three-Machine Flow Shop Scheduling

    Bo Chen;Celia A. Glass;Chris N. Potts;Vitaly A. Strusevich

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

    J. N. D. Gupta;V. A. Strusevich;C. M. Zwaneveld

Frequent Co-Authors

Hans Kellerer
Hans Kellerer University of Graz
Chris N. Potts
Chris N. Potts University of Southampton
Alexandre Dolgui
Alexandre Dolgui IMT Atlantique
Mikhail Y. Kovalyov
Mikhail Y. Kovalyov National Academy of Sciences of Belarus
Gur Mosheiov
Gur Mosheiov Hebrew University of Jerusalem
Jean-Marie Proth
Jean-Marie Proth French Institute for Research in Computer Science and Automation - INRIA
Chung Yee Lee
Chung Yee Lee Hong Kong University of Science and Technology
Richard W. Eglese
Richard W. Eglese Lancaster University
Silvano Martello
Silvano Martello University of Bologna
Jacek Blazewicz
Jacek Blazewicz Poznań University of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various advanced study options and career paths. For those interested in integrating analytical skills with business acumen, exploring a masters degree in marketing can be a strategic move. This degree often merges quantitative analysis with market research, ideal for math graduates.

Additionally, many students consider management roles post-graduation. A one year MBA offers an accelerated path to leadership and business strategy, perfectly complementing a math background.

If you have existing graduate credits, you might wonder about flexibility. Numerous programs accept credit transfers—learning more about can you transfer credits into an mba program can help you save time and resources.

For those looking to stay within data-focused roles, many find the data analytics masters programs a natural next step. These programs build directly on mathematical foundations and are highly valued in today’s data-driven industries.

Best Scientists Citing Vitaly A. Strusevich

Trending Scientists

Recently Published Articles