Yuri N. Sotskov

According to our database, Yuri N. Sotskov authored at least 49 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Stability of a schedule minimising the makespan for processing jobs on identical machines.

Yuri N. Sotskov

Int. J. Prod. Res., October, 2023

Optimization of Selection and Use of a Machine and Tractor Fleet in Agricultural Enterprises: A Case Study.

Andrei A. Efremov, Yuri N. Sotskov, Yulia S. Belotzkaya

Algorithms, July, 2023

Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives.

Yuri N. Sotskov

Algorithms, February, 2023

A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring.

Yuri N. Sotskov

Autom. Remote. Control., February, 2023

2021

Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem.

Yuri N. Sotskov, Evangelina I. Mihova

Algorithms, 2021

2020

Special Issue on Exact and Heuristic Scheduling Algorithms.

Frank Werner, Larysa Burtseva, Yuri N. Sotskov

Algorithms, 2020

Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations.

Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura

Algorithms, 2020

Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times.

Yuri N. Sotskov

Autom. Remote. Control., 2020

2019

The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.

Tsung-Chyan Lai, Yuri N. Sotskov, Alexandre Dolgui

Eur. J. Oper. Res., 2019

Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines.

Omid Gholami, Yuri N. Sotskov, Frank Werner, A. S. Zatsiupo

Autom. Remote. Control., 2019

2018

The optimality box in uncertain data for minimising the sum of the weighted job completion times.

Tsung-Chyan Lai, Yuri N. Sotskov, Natalja G. Egorova, Frank Werner

Int. J. Prod. Res., 2018

Special Issue on Algorithms for Scheduling Problems.

Frank Werner, Larysa Burtseva, Yuri N. Sotskov

Algorithms, 2018

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective.

Yuri N. Sotskov, Natalja G. Egorova

Algorithms, 2018

2017

Mixed graph model and algorithms for parallel-machine job-shop scheduling problems.

Yuri N. Sotskov, Omid Gholami

Int. J. Prod. Res., 2017

2015

Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.

Yuri N. Sotskov, Alexandre Dolgui, Tsung-Chyan Lai, Aksana Zatsiupa

Comput. Ind. Eng., 2015

2014

Stability polyhedra of optimal permutation of jobs servicing.

Yuri N. Sotskov, Natalja G. Egorova

Autom. Remote. Control., 2014

Scientific school of Academician V. S. Tanaev: Results on the scheduling theory.

Mikhail Y. Kovalyov, Yuri N. Sotskov, Yakov M. Shafransky

Autom. Remote. Control., 2014

Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines".

Omid Gholami, Yuri N. Sotskov

Autom. Remote. Control., 2014

A neural network algorithm for servicing jobs with sequential and parallel machines.

Omid Gholami, Yuri N. Sotskov

Autom. Remote. Control., 2014

2013

Measures of problem uncertainty for scheduling with interval processing times.

Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner

OR Spectr., 2013

Scheduling Personal Finances via Integer Programming.

Oliver Braun, Yuri N. Sotskov

J. Math. Model. Algorithms Oper. Res., 2013

Stable Optimal Line Balances with a Fixed Set of the Working Stations.

Yuri N. Sotskov, Aksana Zatsiupa, Alexandre Dolgui

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning.

Yuri N. Sotskov, Omid Gholami, Frank Werner

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012

Vyacheslav Tanaev: contributions to scheduling and related areas.

Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov

J. Sched., 2012

Minimizing total weighted flow time under uncertainty using dominance and a stability box.

Yuri N. Sotskov, Tsung-Chyan Lai

Comput. Oper. Res., 2012

Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway.

Omid Gholami, Yuri N. Sotskov, Frank Werner

Proceedings of the SIMULTECH 2012 - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, Italy, 28, 2012

2011

The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data.

Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner

Proceedings of the Simulation and Modeling Methodologies, Technologies and Applications, 2011

The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times.

Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai, Frank Werner

Proceedings of the SIMULTECH 2011 - Proceedings of 1st International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Noordwijkerhout, The Netherlands, 29, 2011

2009

Minimizing total weighted flow time of a set of jobs with interval processing times.

Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai

Math. Comput. Model., 2009

Schedule execution for two-machine flow-shop with interval processing times.

Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai

Math. Comput. Model., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.

C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng

Asia Pac. J. Oper. Res., 2009

2007

Complexity of shop-scheduling problems with fixed number of jobs: a survey.

Peter Brucker, Yuri N. Sotskov, Frank Werner

Math. Methods Oper. Res., 2007

2006

Optimality of Jackson's permutations with respect to limited machine availability.

Oliver Braun, Natalja M. Leshchenko, Yuri N. Sotskov

Int. Trans. Oper. Res., 2006

Stability analysis of an optimal balance for an assembly line with fixed cycle time.

Yuri N. Sotskov, Alexandre Dolgui, Marie-Claude Portmann

Eur. J. Oper. Res., 2006

Using mixed graph coloring to minimize total completion time in job shop scheduling.

Fawaz S. Al-Anzi, Yuri N. Sotskov, Ali Allahverdi, George V. Andreev

Appl. Math. Comput., 2006

2004

Flowshop scheduling problem to minimize total completion time with random and bounded processing times.

Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai

J. Oper. Res. Soc., 2004

Mean flow time minimization with given bounds of processing times.

Tsung-Chyan Lai, Yuri N. Sotskov, Nadezhda Sotskova, Frank Werner

Eur. J. Oper. Res., 2004

2002

Heuristics for hybrid flow shops with controllable processing times and assignable due dates.

Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov

Comput. Oper. Res., 2002

2001

Stability radius of the optimal assembly line balance with fixed cycle time.

Yuri N. Sotskov, Alexandre Dolgui

Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001

2000

Complexity of mixed shop scheduling problems: A survey.

Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner

Eur. J. Oper. Res., 2000

1999

On the application of insertion techniques for job shop problems with setup times.

Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner

RAIRO Oper. Res., 1999

Preemptive job-shop scheduling problems with a fixed number of jobs.

Peter Brucker, Svetlana A. Kravchenko, Yuri N. Sotskov

Math. Methods Oper. Res., 1999

Sequencing with uncertain numerical data for makespan minimisation.

Tsung-Chyan Lai, Yuri N. Sotskov

J. Oper. Res. Soc., 1999

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.

Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner

Ann. Oper. Res., 1999

1998

On the calculation of the stability radiusof an optimal or an approximate schedule.

Yuri N. Sotskov, Albert P. M. Wagelmans, Frank Werner

Ann. Oper. Res., 1998

1996

Optimal makespan schedule for three jobs on two machines.

Svetlana A. Kravchenko, Yuri N. Sotskov

Math. Methods Oper. Res., 1996

1995

NP-hardness of Shop-scheduling Problems with Three Jobs.

Yuri N. Sotskov, Natalia V. Shakhlevich

Discret. Appl. Math., 1995

Some Concepts of Stability Analysis in Combinatorial optimization.

Yuri N. Sotskov, Vladimir K. Leont'ev, Evgenii N. Gordeev

Discret. Appl. Math., 1995

1994

Scheduling two jobs with fixed and nonfixed routes.

Natalia V. Shakhlevich, Yuri N. Sotskov

Computing, 1994