Scheduling two jobs with fixed and nonfixed routes. - Natalia V. Shakhlevich; Yuri N. Sotskov (Computing, 1994)

Some Concepts of Stability Analysis in Combinatorial optimization. - Yuri N. Sotskov; Vladimir K. Leont'ev; Evgenii N. Gordeev (Discret. Appl. Math., 1995)

NP-hardness of Shop-scheduling Problems with Three Jobs. - Yuri N. Sotskov; Natalia V. Shakhlevich (Discret. Appl. Math., 1995)

Optimal makespan schedule for three jobs on two machines. - Svetlana A. Kravchenko; Yuri N. Sotskov (Math. Methods Oper. Res., 1996)

On the calculation of the stability radiusof an optimal or an approximate schedule. - Yuri N. Sotskov; Albert P. M. Wagelmans; Frank Werner 001 (Ann. Oper. Res., 1998)

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. - Natalia V. Shakhlevich; Yuri N. Sotskov; Frank Werner 001 (Ann. Oper. Res., 1999)

Sequencing with uncertain numerical data for makespan minimisation. - Tsung-Chyan Lai; Yuri N. Sotskov (J. Oper. Res. Soc., 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)

On the application of insertion techniques for job shop problems with setup times. - Yuri N. Sotskov; Thomas Tautenhahn; Frank Werner 001 (RAIRO Oper. Res., 1999)

Complexity of mixed shop scheduling problems: A survey. - Natalia V. Shakhlevich; Yuri N. Sotskov; Frank Werner 001 (Eur. J. Oper. Res., 2000)

Stability radius of the optimal assembly line balance with fixed cycle time. - Yuri N. Sotskov; Alexandre Dolgui (ETFA (1), 2001)

Heuristics for hybrid flow shops with controllable processing times and assignable due dates. - Jatinder N. D. Gupta; Karin Krüger; Volker Lauff; Frank Werner 001; Yuri N. Sotskov (Comput. Oper. Res., 2002)

Mean flow time minimization with given bounds of processing times. - Tsung-Chyan Lai; Yuri N. Sotskov; Nadezhda Sotskova; Frank Werner 001 (Eur. J. Oper. Res., 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)

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)

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)

Optimality of Jackson's permutations with respect to limited machine availability. - Oliver Braun; Natalja M. Leshchenko; Yuri N. Sotskov (Int. Trans. Oper. Res., 2006)

Complexity of shop-scheduling problems with fixed number of jobs: a survey. - Peter Brucker; Yuri N. Sotskov; Frank Werner 001 (Math. Methods Oper. Res., 2007)

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. - C. T. Ng 001; Natalja M. Matsveichuk; Yuri N. Sotskov; T. C. Edwin Cheng (Asia Pac. J. Oper. Res., 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)

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)

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 001 (SIMULTECH, 2011)

The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. - Yuri N. Sotskov; Tsung-Chyan Lai; Frank Werner 001 (SIMULTECH (Selected Papers), 2011)

Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway. - Omid Gholami; Yuri N. Sotskov; Frank Werner 001 (SIMULTECH, 2012)

Minimizing total weighted flow time under uncertainty using dominance and a stability box. - Yuri N. Sotskov; Tsung-Chyan Lai (Comput. Oper. Res., 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)

Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning. - Yuri N. Sotskov; Omid Gholami; Frank Werner 001 (MIM, 2013)

Stable Optimal Line Balances with a Fixed Set of the Working Stations. - Yuri N. Sotskov; Aksana Zatsiupa; Alexandre Dolgui (MIM, 2013)

Scheduling Personal Finances via Integer Programming. - Oliver Braun; Yuri N. Sotskov (J. Math. Model. Algorithms Oper. Res., 2013)

Measures of problem uncertainty for scheduling with interval processing times. - Yuri N. Sotskov; Tsung-Chyan Lai; Frank Werner 001 (OR Spectr., 2013)

A neural network algorithm for servicing jobs with sequential and parallel machines. - Omid Gholami; Yuri N. Sotskov (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)

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)

Stability polyhedra of optimal permutation of jobs servicing. - Yuri N. Sotskov; Natalja G. Egorova (Autom. Remote. Control., 2014)

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)

Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. - Yuri N. Sotskov; Omid Gholami (Int. J. Prod. Res., 2017)

Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. - Yuri N. Sotskov; Natalja G. Egorova (Algorithms, 2018)

Special Issue on Algorithms for Scheduling Problems. - Frank Werner 001; Larysa Burtseva; Yuri N. Sotskov (Algorithms, 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 001 (Int. J. Prod. Res., 2018)

Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines. - Omid Gholami; Yuri N. Sotskov; Frank Werner 001; A. S. Zatsiupo (Autom. Remote. Control., 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)

Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. - Yuri N. Sotskov (Autom. Remote. Control., 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)

Special Issue on Exact and Heuristic Scheduling Algorithms. - Frank Werner 001; Larysa Burtseva; Yuri N. Sotskov (Algorithms, 2020)

Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem. - Yuri N. Sotskov; Evangelina I. Mihova (Algorithms, 2021)

A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring. - Yuri N. Sotskov (Autom. Remote. Control., 2023)

Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives. - Yuri N. Sotskov (Algorithms, 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, 2023)

Stability of a schedule minimising the makespan for processing jobs on identical machines. - Yuri N. Sotskov (Int. J. Prod. Res., 2023)

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. - Liangliang Sun; Xirang Hao; Yunpeng Li; Jinghan Xue; Natalja M. Matsveichuk; Yuri N. Sotskov; Qichun Zhang (Complex Syst. Model. Simul., 2024)

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates. - Evangelina I. Mihova; Yuri N. Sotskov (Algorithms, 2024)

A review of dynamic flexible regulation strategies for multi-energy coupled steelmaking-continuous casting production. - Liangliang Sun; Hao Li; Zhenghao Song; Ge Guo 001; Changyu Wang; Natalja M. Matsveichuk; Yuri N. Sotskov (Eng. Appl. Artif. Intell., 2025)

Hierarchically controlled differential evolution algorithm. - Liangliang Sun; Zhenghao Song; Jing Liu 070; Haipeng Ji; Ge Guo 001; Natalja M. Matsveichuk; Yuri N. Sotskov (Expert Syst. Appl., 2025)

Diversity enhancement-based Differential Evolution with a novel perturbation strategy. - Zhenghao Song; Liangliang Sun; Natalja M. Matsveichuk; Yuri N. Sotskov (Swarm Evol. Comput., 2025)

Differential evolution based on individual information parameter setting and diversity measurement of aggregated distribution. - Zhenghao Song; Liangliang Sun; Natalja M. Matsveichuk; Yuri N. Sotskov; Shenglong Jiang; Yang Yu (Swarm Evol. Comput., 2025)

An iterative greedy algorithm based on neighborhood search for energy-efficient scheduling of distributed permutation flowshop with sequence-dependent setup time. - Quan Zhong; Yang Yu; Zixiang Li; Liangliang Sun; Yuyan Han; Natalja M. Matsveichuk; Yuri N. Sotskov (Expert Syst. Appl., 2026)