Yuri N. Sotskov

Affiliations:
  • National Academy of Sciences of Belarus, Minsk, Belarus


According to our database1, Yuri N. Sotskov authored at least 45 papers between 1994 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2020
Special Issue on Exact and Heuristic Scheduling Algorithms.
Algorithms, 2020

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

Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times.
Autom. Remote. Control., 2020

2019
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line.
Eur. J. Oper. Res., 2019

Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines.
Autom. Remote. Control., 2019

2018
The optimality box in uncertain data for minimising the sum of the weighted job completion times.
Int. J. Prod. Res., 2018

Special Issue on Algorithms for Scheduling Problems.
Algorithms, 2018

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

2017
Mixed graph model and algorithms for parallel-machine job-shop scheduling problems.
Int. J. Prod. Res., 2017

2015
Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines.
Comput. Ind. Eng., 2015

2014
Stability polyhedra of optimal permutation of jobs servicing.
Autom. Remote. Control., 2014

Scientific school of Academician V. S. Tanaev: Results on the scheduling theory.
Autom. Remote. Control., 2014

Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines".
Autom. Remote. Control., 2014

A neural network algorithm for servicing jobs with sequential and parallel machines.
Autom. Remote. Control., 2014

2013
Measures of problem uncertainty for scheduling with interval processing times.
OR Spectr., 2013

Scheduling Personal Finances via Integer Programming.
J. Math. Model. Algorithms Oper. Res., 2013

Stable Optimal Line Balances with a Fixed Set of the Working Stations.
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.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched., 2012

Minimizing total weighted flow time under uncertainty using dominance and a stability box.
Comput. Oper. Res., 2012

Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway.
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.
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.
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.
Math. Comput. Model., 2009

Schedule execution for two-machine flow-shop with interval processing times.
Math. Comput. Model., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res., 2009

2007
Complexity of shop-scheduling problems with fixed number of jobs: a survey.
Math. Methods Oper. Res., 2007

2006
Optimality of Jackson's permutations with respect to limited machine availability.
Int. Trans. Oper. Res., 2006

Stability analysis of an optimal balance for an assembly line with fixed cycle time.
Eur. J. Oper. Res., 2006

Using mixed graph coloring to minimize total completion time in job shop scheduling.
Appl. Math. Comput., 2006

2004
Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
J. Oper. Res. Soc., 2004

Mean flow time minimization with given bounds of processing times.
Eur. J. Oper. Res., 2004

2002
Heuristics for hybrid flow shops with controllable processing times and assignable due dates.
Comput. Oper. Res., 2002

2001
Stability radius of the optimal assembly line balance with fixed cycle time.
Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, 2001

2000
Complexity of mixed shop scheduling problems: A survey.
Eur. J. Oper. Res., 2000

1999
On the application of insertion techniques for job shop problems with setup times.
RAIRO Oper. Res., 1999

Preemptive job-shop scheduling problems with a fixed number of jobs.
Math. Methods Oper. Res., 1999

Sequencing with uncertain numerical data for makespan minimisation.
J. Oper. Res. Soc., 1999

Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs.
Ann. Oper. Res., 1999

1998
On the calculation of the stability radiusof an optimal or an approximate schedule.
Ann. Oper. Res., 1998

1996
Optimal makespan schedule for three jobs on two machines.
Math. Methods Oper. Res., 1996

1995
NP-hardness of Shop-scheduling Problems with Three Jobs.
Discret. Appl. Math., 1995

Some Concepts of Stability Analysis in Combinatorial optimization.
Discret. Appl. Math., 1995

1994
Scheduling two jobs with fixed and nonfixed routes.
Computing, 1994


  Loading...