Yuri N. Sotskov

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 15

Top Topics

Scheduling Problem

Top Venues

Autom. Remote. Control.

Int. J. Prod. Res.

Comput. Ind. Eng.

Publications

Evangelina I. Mihova, Yuri N. Sotskov
Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates. Algorithms 17 (7) (2024)
Yuri N. Sotskov
Stability of a schedule minimising the makespan for processing jobs on identical machines. Int. J. Prod. Res. 61 (19) (2023)
Yuri N. Sotskov
A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring. Autom. Remote. Control. 84 (2) (2023)
Yuri N. Sotskov
Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives. Algorithms 16 (2) (2023)
Andrei A. Efremov, Yuri N. Sotskov, Yulia S. Belotzkaya
Optimization of Selection and Use of a Machine and Tractor Fleet in Agricultural Enterprises: A Case Study. Algorithms 16 (7) (2023)
Yuri N. Sotskov, Evangelina I. Mihova
Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem. Algorithms 14 (8) (2021)
Yuri N. Sotskov
Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. Autom. Remote. Control. 81 (5) (2020)
Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations. Algorithms 13 (1) (2020)
Frank Werner, Larysa Burtseva, Yuri N. Sotskov
Special Issue on Exact and Heuristic Scheduling Algorithms. Algorithms 13 (1) (2020)
Omid Gholami, Yuri N. Sotskov, Frank Werner, A. S. Zatsiupo
Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines. Autom. Remote. Control. 80 (2) (2019)
Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line. Eur. J. Oper. Res. 274 (2) (2019)
Frank Werner, Larysa Burtseva, Yuri N. Sotskov
Special Issue on Algorithms for Scheduling Problems. Algorithms 11 (6) (2018)
Yuri N. Sotskov, Natalja G. Egorova
Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. Algorithms 11 (5) (2018)
Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner
The optimality box in uncertain data for minimising the sum of the weighted job completion times. Int. J. Prod. Res. 56 (19) (2018)
Yuri N. Sotskov, Omid Gholami
Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. Int. J. Prod. Res. 55 (6) (2017)
Yuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines. Comput. Ind. Eng. 90 (2015)
Mikhail Y. Kovalyov, Yuri N. Sotskov, Yakov M. Shafransky
Scientific school of Academician V. S. Tanaev: Results on the scheduling theory. Autom. Remote. Control. 75 (7) (2014)
Omid Gholami, Yuri N. Sotskov
A neural network algorithm for servicing jobs with sequential and parallel machines. Autom. Remote. Control. 75 (7) (2014)
Omid Gholami, Yuri N. Sotskov
Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines". Autom. Remote. Control. 75 (9) (2014)
Yuri N. Sotskov, Natalja G. Egorova
Stability polyhedra of optimal permutation of jobs servicing. Autom. Remote. Control. 75 (7) (2014)
Yuri N. Sotskov, Omid Gholami, Frank Werner
Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning. MIM (2013)
Yuri N. Sotskov, Aksana Zatsiupa, Alexandre Dolgui
Stable Optimal Line Balances with a Fixed Set of the Working Stations. MIM (2013)
Oliver Braun, Yuri N. Sotskov
Scheduling Personal Finances via Integer Programming. J. Math. Model. Algorithms Oper. Res. 12 (2) (2013)
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
Measures of problem uncertainty for scheduling with interval processing times. OR Spectr. 35 (3) (2013)
Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov
Vyacheslav Tanaev: contributions to scheduling and related areas. J. Sched. 15 (4) (2012)
Omid Gholami, Yuri N. Sotskov, Frank Werner
Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway. SIMULTECH (2012)
Yuri N. Sotskov, Tsung-Chyan Lai
Minimizing total weighted flow time under uncertainty using dominance and a stability box. Comput. Oper. Res. 39 (6) (2012)
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner
The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times. SIMULTECH (2011)
Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. SIMULTECH (Selected Papers) (2011)
Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
Minimizing total weighted flow time of a set of jobs with interval processing times. Math. Comput. Model. 50 (3-4) (2009)
C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng
Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. Asia Pac. J. Oper. Res. 26 (6) (2009)
Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai
Schedule execution for two-machine flow-shop with interval processing times. Math. Comput. Model. 49 (5-6) (2009)
Peter Brucker, Yuri N. Sotskov, Frank Werner
Complexity of shop-scheduling problems with fixed number of jobs: a survey. Math. Methods Oper. Res. 65 (3) (2007)
Oliver Braun, Natalja M. Leshchenko, Yuri N. Sotskov
Optimality of Jackson's permutations with respect to limited machine availability. Int. Trans. Oper. Res. 13 (1) (2006)
Yuri N. Sotskov, Alexandre Dolgui, Marie-Claude Portmann
Stability analysis of an optimal balance for an assembly line with fixed cycle time. Eur. J. Oper. Res. 168 (3) (2006)
Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev
Using mixed graph coloring to minimize total completion time in job shop scheduling. Appl. Math. Comput. 182 (2) (2006)
Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai
Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55 (3) (2004)
Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner
Mean flow time minimization with given bounds of processing times. Eur. J. Oper. Res. 159 (3) (2004)
Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov
Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res. 29 (10) (2002)
Yuri N. Sotskov, Alexandre Dolgui
Stability radius of the optimal assembly line balance with fixed cycle time. ETFA (1) (2001)
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
Complexity of mixed shop scheduling problems: A survey. Eur. J. Oper. Res. 120 (2) (2000)
Tsung-Chyan Lai, Yuri N. Sotskov
Sequencing with uncertain numerical data for makespan minimisation. J. Oper. Res. Soc. 50 (3) (1999)
Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. Ann. Oper. Res. 92 (1999)
Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov
Preemptive job-shop scheduling problems with a fixed number of jobs. Math. Methods Oper. Res. 49 (1) (1999)
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner
On the application of insertion techniques for job shop problems with setup times. RAIRO Oper. Res. 33 (2) (1999)
Yuri N. Sotskov, Albert P. M. Wagelmans, Frank Werner
On the calculation of the stability radiusof an optimal or an approximate schedule. Ann. Oper. Res. 83 (1998)
Svetlana A. Kravchenko, Yuri N. Sotskov
Optimal makespan schedule for three jobs on two machines. Math. Methods Oper. Res. 43 (2) (1996)
Yuri N. Sotskov, Vladimir K. Leont'ev, Evgenii N. Gordeev
Some Concepts of Stability Analysis in Combinatorial optimization. Discret. Appl. Math. 58 (2) (1995)
Yuri N. Sotskov, Natalia V. Shakhlevich
NP-hardness of Shop-scheduling Problems with Three Jobs. Discret. Appl. Math. 59 (3) (1995)
Natalia V. Shakhlevich, Yuri N. Sotskov
Scheduling two jobs with fixed and nonfixed routes. Computing 52 (1) (1994)