default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri N. Sotskov
Person information
- affiliation: National Academy of Sciences of Belarus, Minsk, Belarus
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]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): 299 (2024)- 2023
- [j43]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): 167-186 (2023) - [j42]Yuri N. Sotskov:
Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives. Algorithms 16(2): 100 (2023) - [j41]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): 311 (2023) - [j40]Yuri N. Sotskov:
Stability of a schedule minimising the makespan for processing jobs on identical machines. Int. J. Prod. Res. 61(19): 6434-6450 (2023) - 2021
- [j39]Yuri N. Sotskov, Evangelina I. Mihova:
Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem. Algorithms 14(8): 246 (2021) - 2020
- [j38]Yuri N. Sotskov:
Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. Autom. Remote. Control. 81(5): 819-842 (2020) - [j37]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): 4 (2020) - [j36]Frank Werner, Larysa Burtseva, Yuri N. Sotskov:
Special Issue on Exact and Heuristic Scheduling Algorithms. Algorithms 13(1): 9 (2020)
2010 – 2019
- 2019
- [j35]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): 297-316 (2019) - [j34]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): 466-481 (2019) - 2018
- [j33]Yuri N. Sotskov, Natalja G. Egorova:
Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. Algorithms 11(5): 66 (2018) - [j32]Frank Werner, Larysa Burtseva, Yuri N. Sotskov:
Special Issue on Algorithms for Scheduling Problems. Algorithms 11(6): 87 (2018) - [j31]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): 6336-6362 (2018) - 2017
- [j30]Yuri N. Sotskov, Omid Gholami:
Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. Int. J. Prod. Res. 55(6): 1549-1564 (2017) - 2015
- [j29]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: 241-258 (2015) - 2014
- [j28]Omid Gholami, Yuri N. Sotskov:
A neural network algorithm for servicing jobs with sequential and parallel machines. Autom. Remote. Control. 75(7): 1203-1220 (2014) - [j27]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): 1241-1256 (2014) - [j26]Yuri N. Sotskov, Natalja G. Egorova:
Stability polyhedra of optimal permutation of jobs servicing. Autom. Remote. Control. 75(7): 1267-1282 (2014) - [j25]Omid Gholami, Yuri N. Sotskov:
Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines". Autom. Remote. Control. 75(9): 1716 (2014) - 2013
- [j24]Oliver Braun, Yuri N. Sotskov:
Scheduling Personal Finances via Integer Programming. J. Math. Model. Algorithms Oper. Res. 12(2): 179-199 (2013) - [j23]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner:
Measures of problem uncertainty for scheduling with interval processing times. OR Spectr. 35(3): 659-689 (2013) - [c6]Yuri N. Sotskov, Omid Gholami, Frank Werner:
Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning. MIM 2013: 1352-1357 - [c5]Yuri N. Sotskov, Aksana Zatsiupa, Alexandre Dolgui:
Stable Optimal Line Balances with a Fixed Set of the Working Stations. MIM 2013: 1726-1731 - 2012
- [j22]Yuri N. Sotskov, Tsung-Chyan Lai:
Minimizing total weighted flow time under uncertainty using dominance and a stability box. Comput. Oper. Res. 39(6): 1271-1289 (2012) - [j21]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): 403-418 (2012) - [c4]Omid Gholami, Yuri N. Sotskov, Frank Werner:
Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway. SIMULTECH 2012: 425-430 - 2011
- [c3]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: 14-23 - [c2]Yuri N. Sotskov, Tsung-Chyan Lai, Frank Werner:
The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. SIMULTECH (Selected Papers) 2011: 39-55
2000 – 2009
- 2009
- [j20]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): 715-734 (2009) - [j19]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): 991-1011 (2009) - [j18]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): 556-573 (2009) - 2007
- [j17]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): 461-481 (2007) - 2006
- [j16]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): 1137-1148 (2006) - [j15]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): 783-797 (2006) - [j14]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): 59-74 (2006) - 2004
- [j13]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): 558-573 (2004) - [j12]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): 277-286 (2004) - 2002
- [j11]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): 1417-1439 (2002) - 2001
- [c1]Yuri N. Sotskov, Alexandre Dolgui:
Stability radius of the optimal assembly line balance with fixed cycle time. ETFA (1) 2001: 623-628 - 2000
- [j10]Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Complexity of mixed shop scheduling problems: A survey. Eur. J. Oper. Res. 120(2): 343-351 (2000)
1990 – 1999
- 1999
- [j9]Natalia V. Shakhlevich, Yuri N. Sotskov, Frank Werner:
Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. Ann. Oper. Res. 92: 281-304 (1999) - [j8]Tsung-Chyan Lai, Yuri N. Sotskov:
Sequencing with uncertain numerical data for makespan minimisation. J. Oper. Res. Soc. 50(3): 230-243 (1999) - [j7]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): 41-76 (1999) - [j6]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): 209-245 (1999) - 1998
- [j5]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: 213-252 (1998) - 1996
- [j4]Svetlana A. Kravchenko, Yuri N. Sotskov:
Optimal makespan schedule for three jobs on two machines. Math. Methods Oper. Res. 43(2): 233-238 (1996) - 1995
- [j3]Yuri N. Sotskov, Vladimir K. Leont'ev, Evgenii N. Gordeev:
Some Concepts of Stability Analysis in Combinatorial optimization. Discret. Appl. Math. 58(2): 169-190 (1995) - [j2]Yuri N. Sotskov, Natalia V. Shakhlevich:
NP-hardness of Shop-scheduling Problems with Three Jobs. Discret. Appl. Math. 59(3): 237-266 (1995) - 1994
- [j1]Natalia V. Shakhlevich, Yuri N. Sotskov:
Scheduling two jobs with fixed and nonfixed routes. Computing 52(1): 17-30 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
