Yuri N. Sotskov

61 papers C 2Journal 55Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
An adaptive differential evolution with deeply informed mutation strategy and historical information for numerical optimization.
Inf. Sci.
Junyi Gou, Liangliang Sun, Jing Liu, Zhenghao Song, Ge Guo, SheGan Gao, Ke Liu, Natalja M. Matsveichuk, Yuri N. Sotskov
2026 J jnl
An iterative greedy algorithm based on neighborhood search for energy-efficient scheduling of distributed permutation flowshop with sequence-dependent setup time.
Expert Syst. Appl.
Quan Zhong, Yang Yu, Zixiang Li, Liangliang Sun, Yuyan Han, Natalja M. Matsveichuk, Yuri N. Sotskov
2026 J jnl
Cooperative co-evolution based differential evolutional algorithm.
Expert Syst. Appl.
Junyi Gou, Zhenghao Song, Liangliang Sun, Natalja M. Matsveichuk, Yuri N. Sotskov, Qichun Zhang, Ge Guo
2026 J jnl
Differential evolution with a variance contribution ratio-based diversity enhancement mechanism for numerical optimization.
Swarm Evol. Comput.
Liqi Zhao, Liangliang Sun, Zhenghao Song, Qichun Zhang, Natalja M. Matsveichuk, Yuri N. Sotskov
2026 J jnl
Discrete artificial bee colony algorithm based on multiple neighborhood swaps for the hybrid flowshop scheduling problem with uncertain processing stages.
Swarm Evol. Comput.
Yang Yu, Xinbo Song, Zixiang Li, Liangliang Sun, Yuyan Han, Xinfu Pang, Zhujun Wang, Natalja M. Matsveichuk, Yuri N. Sotskov
2025 J jnl
A review of dynamic flexible regulation strategies for multi-energy coupled steelmaking-continuous casting production.
Eng. Appl. Artif. Intell.
Liangliang Sun, Hao Li, Zhenghao Song, Ge Guo, Changyu Wang, Natalja M. Matsveichuk, Yuri N. Sotskov
2025 J jnl
Differential evolution based on individual information parameter setting and diversity measurement of aggregated distribution.
Swarm Evol. Comput.
Zhenghao Song, Liangliang Sun, Natalja M. Matsveichuk, Yuri N. Sotskov, Shenglong Jiang, Yang Yu
2025 J jnl
Differential evolution with bi-strategy co-deployment framework and diversity improvement.
Swarm Evol. Comput.
Liangliang Sun, Zhenghao Song, Ge Guo, Yucheng Zhang, Natalja M. Matsveichuk, Yuri N. Sotskov
2025 J jnl
Diversity enhancement-based Differential Evolution with a novel perturbation strategy.
Swarm Evol. Comput.
Zhenghao Song, Liangliang Sun, Natalja M. Matsveichuk, Yuri N. Sotskov
2025 J jnl
Hierarchically controlled differential evolution algorithm.
Expert Syst. Appl.
Liangliang Sun, Zhenghao Song, Jing Liu, Haipeng Ji, Ge Guo, Natalja M. Matsveichuk, Yuri N. Sotskov
2024 J jnl
A Review of Integrated Optimization Method of Batch Planning and Scheduling for Steelmaking-Continuous Casting-Hot Rolling Production Under Uncertain Environment Based on Lagrangian Relaxation Framework.
Complex Syst. Model. Simul.
Liangliang Sun, Xirang Hao, Yunpeng Li, Jinghan Xue, Natalja M. Matsveichuk, Yuri N. Sotskov, Qichun Zhang
2024 J jnl
Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates.
Algorithms
Evangelina I. Mihova, Yuri N. Sotskov
2023 J jnl
A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring.
Autom. Remote. Control.
Yuri N. Sotskov
2023 J jnl
Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives.
Algorithms
Yuri N. Sotskov
2023 J jnl
Optimization of Selection and Use of a Machine and Tractor Fleet in Agricultural Enterprises: A Case Study.
Algorithms
Andrei A. Efremov, Yuri N. Sotskov, Yulia S. Belotzkaya
2023 J jnl
Stability of a schedule minimising the makespan for processing jobs on identical machines.
Int. J. Prod. Res.
Yuri N. Sotskov
2021 J jnl
Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem.
Algorithms
Yuri N. Sotskov, Evangelina I. Mihova
2020 J jnl
Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times.
Autom. Remote. Control.
Yuri N. Sotskov
2020 J jnl
Special Issue on Exact and Heuristic Scheduling Algorithms.
Algorithms
Frank Werner, Larysa Burtseva, Yuri N. Sotskov
2020 J jnl
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations.
Algorithms
Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura
2019 J jnl
Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines.
Autom. Remote. Control.
Omid Gholami, Yuri N. Sotskov, Frank Werner, A. S. Zatsiupo
2019 J jnl
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.
Eur. J. Oper. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui
2018 J jnl
Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective.
Algorithms
Yuri N. Sotskov, Natalja G. Egorova
2018 J jnl
Special Issue on Algorithms for Scheduling Problems.
Algorithms
Frank Werner, Larysa Burtseva, Yuri N. Sotskov
2018 J jnl
The optimality box in uncertain data for minimising the sum of the weighted job completion times.
Int. J. Prod. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner
2017 J jnl
Mixed graph model and algorithms for parallel-machine job-shop scheduling problems.
Int. J. Prod. Res.
Yuri N. Sotskov, Omid Gholami
2015 J jnl
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.
Comput. Ind. Eng.
Yuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa
2014 J jnl
A neural network algorithm for servicing jobs with sequential and parallel machines.
Autom. Remote. Control.
Omid Gholami, Yuri N. Sotskov
2014 J jnl
Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines".
Autom. Remote. Control.
Omid Gholami, Yuri N. Sotskov
2014 J jnl
Scientific school of Academician V. S. Tanaev: Results on the scheduling theory.
Autom. Remote. Control.
Mikhail Y. Kovalyov, Yuri N. Sotskov, Yakov M. Shafransky
2014 J jnl
Stability polyhedra of optimal permutation of jobs servicing.
Autom. Remote. Control.
Yuri N. Sotskov, Natalja G. Egorova
2013 J jnl
Measures of problem uncertainty for scheduling with interval processing times.
OR Spectr.
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
2013 J jnl
Scheduling Personal Finances via Integer Programming.
J. Math. Model. Algorithms Oper. Res.
Oliver Braun, Yuri N. Sotskov
2013 — conf
Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning.
MIM
Yuri N. Sotskov, Omid Gholami, Frank Werner
2013 — conf
Stable Optimal Line Balances with a Fixed Set of the Working Stations.
MIM
Yuri N. Sotskov, Aksana Zatsiupa, Alexandre Dolgui
2012 C conf
Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway.
SIMULTECH
Omid Gholami, Yuri N. Sotskov, Frank Werner
2012 J jnl
Minimizing total weighted flow time under uncertainty using dominance and a stability box.
Comput. Oper. Res.
Yuri N. Sotskov, Tsung-Chyan Lai
2012 J jnl
Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched.
Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov
2011 — conf
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.
SIMULTECH (Selected Papers)
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
2011 C conf
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times.
SIMULTECH
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner
2009 J jnl
Minimizing total weighted flow time of a set of jobs with interval processing times.
Math. Comput. Model.
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
2009 J jnl
Schedule execution for two-machine flow-shop with interval processing times.
Math. Comput. Model.
Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
2009 J jnl
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res.
C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng
2007 J jnl
Complexity of shop-scheduling problems with fixed number of jobs: a survey.
Math. Methods Oper. Res.
Peter Brucker, Yuri N. Sotskov, Frank Werner
2006 J jnl
Optimality of Jackson's permutations with respect to limited machine availability.
Int. Trans. Oper. Res.
Oliver Braun, Natalja M. Leshchenko, Yuri N. Sotskov
2006 J jnl
Stability analysis of an optimal balance for an assembly line with fixed cycle time.
Eur. J. Oper. Res.
Yuri N. Sotskov, Alexandre Dolgui, Marie-Claude Portmann
2006 J jnl
Using mixed graph coloring to minimize total completion time in job shop scheduling.
Appl. Math. Comput.
Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev
2004 J jnl
Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
J. Oper. Res. Soc.
Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai
2004 J jnl
Mean flow time minimization with given bounds of processing times.
Eur. J. Oper. Res.
Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
2002 J jnl
Heuristics for hybrid flow shops with controllable processing times and assignable due dates.
Comput. Oper. Res.
Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov
2001 — conf
Stability radius of the optimal assembly line balance with fixed cycle time.
ETFA (1)
Yuri N. Sotskov, Alexandre Dolgui
2000 J jnl
Complexity of mixed shop scheduling problems: A survey.
Eur. J. Oper. Res.
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
1999 J jnl
On the application of insertion techniques for job shop problems with setup times.
RAIRO Oper. Res.
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner
1999 J jnl
Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res.
Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov
1999 J jnl
Sequencing with uncertain numerical data for makespan minimisation.
J. Oper. Res. Soc.
Tsung-Chyan Lai, Yuri N. Sotskov
1999 J jnl
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.
Ann. Oper. Res.
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
1998 J jnl
On the calculation of the stability radiusof an optimal or an approximate schedule.
Ann. Oper. Res.
Yuri N. Sotskov, Albert P. M. Wagelmans, Frank Werner
1996 J jnl
Optimal makespan schedule for three jobs on two machines.
Math. Methods Oper. Res.
Svetlana A. Kravchenko, Yuri N. Sotskov
1995 J jnl
NP-hardness of Shop-scheduling Problems with Three Jobs.
Discret. Appl. Math.
Yuri N. Sotskov, Natalia V. Shakhlevich
1995 J jnl
Some Concepts of Stability Analysis in Combinatorial optimization.
Discret. Appl. Math.
Yuri N. Sotskov, Vladimir K. Leont'ev, Evgenii N. Gordeev
1994 J jnl
Scheduling two jobs with fixed and nonfixed routes.
Computing
Natalia V. Shakhlevich, Yuri N. Sotskov