iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.dagstuhl.de/pid/03/4736.xml
Yuri N. Sotskov National Academy of Sciences of Belarus, Minsk, Belarus https://orcid.org/0000-0002-9971-6169
Evangelina I. Mihova Yuri N. Sotskov Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates. 299 2024 July 17 Algorithms 7 https://doi.org/10.3390/a17070299 db/journals/algorithms/algorithms17.html#MihovaS24 streams/journals/algorithms
Yuri N. Sotskov A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring. 167-186 2023 February 84 Autom. Remote. Control. 2 https://doi.org/10.1134/S000511792302008X db/journals/aarc/aarc84.html#Sotskov23
Yuri N. Sotskov Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives. 100 2023 February 16 Algorithms 2 https://doi.org/10.3390/a16020100 db/journals/algorithms/algorithms16.html#Sotskov23
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. 311 2023 July 16 Algorithms 7 https://doi.org/10.3390/a16070311 db/journals/algorithms/algorithms16.html#EfremovSB23
Yuri N. Sotskov Stability of a schedule minimising the makespan for processing jobs on identical machines. 6434-6450 2023 October 61 Int. J. Prod. Res. 19 https://doi.org/10.1080/00207543.2022.2128919 db/journals/ijpr/ijpr61.html#Sotskov23
Yuri N. Sotskov Evangelina I. Mihova Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem. 246 2021 14 Algorithms 8 https://doi.org/10.3390/a14080246 db/journals/algorithms/algorithms14.html#SotskovM21
Yuri N. Sotskov Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. 819-842 2020 81 Autom. Remote. Control. 5 https://doi.org/10.1134/S0005117920050045 db/journals/aarc/aarc81.html#Sotskov20
Yuri N. Sotskov Natalja M. Matsveichuk Vadzim D. Hatsura Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations. 4 2020 13 Algorithms 1 https://doi.org/10.3390/a13010004 db/journals/algorithms/algorithms13.html#SotskovMH20
Frank Werner 0001 Larysa Burtseva Yuri N. Sotskov Special Issue on Exact and Heuristic Scheduling Algorithms. 9 2020 13 Algorithms 1 https://doi.org/10.3390/a13010009 db/journals/algorithms/algorithms13.html#WernerBS20
Omid Gholami Yuri N. Sotskov Frank Werner 0001 A. S. Zatsiupo Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines. 297-316 2019 80 Autom. Remote. Control. 2 https://doi.org/10.1134/S0005117919020085 db/journals/aarc/aarc80.html#GholamiSWZ19
Tsung-Chyan Lai Yuri N. Sotskov Alexandre Dolgui The stability radius of an optimal line balance with maximum efficiency for a simple assembly line. 466-481 2019 274 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2018.10.013 db/journals/eor/eor274.html#LaiSD19
Yuri N. Sotskov Natalja G. Egorova Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective. 66 2018 11 Algorithms 5 https://doi.org/10.3390/a11050066 db/journals/algorithms/algorithms11.html#SotskovE18
Frank Werner 0001 Larysa Burtseva Yuri N. Sotskov Special Issue on Algorithms for Scheduling Problems. 87 2018 11 Algorithms 6 https://doi.org/10.3390/a11060087 https://www.wikidata.org/entity/Q57633747 db/journals/algorithms/algorithms11.html#WernerBS18
Tsung-Chyan Lai Yuri N. Sotskov Natalja G. Egorova Frank Werner 0001 The optimality box in uncertain data for minimising the sum of the weighted job completion times. 6336-6362 2018 56 Int. J. Prod. Res. 19 https://doi.org/10.1080/00207543.2017.1398426 https://www.wikidata.org/entity/Q57633750 db/journals/ijpr/ijpr56.html#LaiSEW18
Yuri N. Sotskov Omid Gholami Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. 1549-1564 2017 55 Int. J. Prod. Res. 6 https://doi.org/10.1080/00207543.2015.1075666 https://www.wikidata.org/entity/Q56582016 db/journals/ijpr/ijpr55.html#SotskovG17
Yuri N. Sotskov Alexandre Dolgui Tsung-Chyan Lai Aksana Zatsiupa Enumerations and stability analysis of feasible and optimal line balances for simple assembly lines. 241-258 2015 90 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2015.08.018 db/journals/candie/candie90.html#SotskovDLZ15
Omid Gholami Yuri N. Sotskov A neural network algorithm for servicing jobs with sequential and parallel machines. 1203-1220 2014 75 Autom. Remote. Control. 7 https://doi.org/10.1134/S0005117914070030 db/journals/aarc/aarc75.html#GholamiS14
Mikhail Y. Kovalyov Yuri N. Sotskov Yakov M. Shafransky Scientific school of Academician V. S. Tanaev: Results on the scheduling theory. 1241-1256 2014 75 Autom. Remote. Control. 7 https://doi.org/10.1134/S0005117914070066 db/journals/aarc/aarc75.html#KovalyovSS14
Yuri N. Sotskov Natalja G. Egorova Stability polyhedra of optimal permutation of jobs servicing. 1267-1282 2014 75 Autom. Remote. Control. 7 https://doi.org/10.1134/S000511791407008X db/journals/aarc/aarc75.html#SotskovE14
Omid Gholami Yuri N. Sotskov Erratum to: "A neural network algorithm for servicing jobs with sequential and parallel machines". 1716 2014 75 Autom. Remote. Control. 9 https://doi.org/10.1134/S0005117914090185 db/journals/aarc/aarc75.html#GholamiS14a
Oliver Braun Yuri N. Sotskov Scheduling Personal Finances via Integer Programming. 179-199 2013 12 J. Math. Model. Algorithms Oper. Res. 2 https://doi.org/10.1007/s10852-012-9201-9 db/journals/jmma/jmma12.html#BraunS13
Yuri N. Sotskov Tsung-Chyan Lai Frank Werner 0001 Measures of problem uncertainty for scheduling with interval processing times. 659-689 2013 35 OR Spectr. 3 https://doi.org/10.1007/s00291-012-0306-3 https://www.wikidata.org/entity/Q57633817 db/journals/ors/ors35.html#SotskovL013
Yuri N. Sotskov Omid Gholami Frank Werner 0001 Solving a Job-Shop Scheduling Problem by an Adaptive Algorithm Based on Learning. 1352-1357 2013 MIM https://doi.org/10.3182/20130619-3-RU-3018.00126 https://www.wikidata.org/entity/Q57633825 conf/mim/2013 db/conf/mim/mim2013.html#SotskovGW13 Yuri N. Sotskov Aksana Zatsiupa Alexandre Dolgui Stable Optimal Line Balances with a Fixed Set of the Working Stations. 1726-1731 2013 MIM https://doi.org/10.3182/20130619-3-RU-3018.00564 conf/mim/2013 db/conf/mim/mim2013.html#SotskovZD13
Yuri N. Sotskov Tsung-Chyan Lai Minimizing total weighted flow time under uncertainty using dominance and a stability box. 1271-1289 2012 39 Comput. Oper. Res. 6 https://doi.org/10.1016/j.cor.2011.02.001 db/journals/cor/cor39.html#SotskovL12
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. 403-418 2012 15 J. Sched. 4 https://doi.org/10.1007/s10951-011-0230-4 https://www.wikidata.org/entity/Q58616791 db/journals/scheduling/scheduling15.html#GordonKLSSST12
Omid Gholami Yuri N. Sotskov Frank Werner 0001 Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway. 425-430 2012 SIMULTECH conf/simultech/2012 db/conf/simultech/simultech2012.html#GholamiSW12 Yuri N. Sotskov Natalja G. Egorova Tsung-Chyan Lai Frank Werner 0001 The Stability Box in Interval Data for Minimizing the Sum of Weighted Completion Times. 14-23 2011 SIMULTECH conf/simultech/2011 db/conf/simultech/simultech2011.html#SotskovELW11 Yuri N. Sotskov Tsung-Chyan Lai Frank Werner 0001 The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data. 39-55 2011 SIMULTECH (Selected Papers) https://doi.org/10.1007/978-3-642-34336-0_3 https://www.wikidata.org/entity/Q57633827 conf/simultech/2011s db/conf/simultech/simultech2011s.html#SotskovLW11
C. T. Ng 0001 Natalja M. Matsveichuk Yuri N. Sotskov T. C. Edwin Cheng Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times. 715-734 2009 26 Asia Pac. J. Oper. Res. 6 https://doi.org/10.1142/S0217595909002432 db/journals/apjor/apjor26.html#NgMSC09
Natalja M. Matsveichuk Yuri N. Sotskov Natalja G. Egorova Tsung-Chyan Lai Schedule execution for two-machine flow-shop with interval processing times. 991-1011 2009 49 Math. Comput. Model. 5-6 https://doi.org/10.1016/j.mcm.2008.02.004 db/journals/mcm/mcm49.html#MatsveichukSEL09
Yuri N. Sotskov Natalja G. Egorova Tsung-Chyan Lai Minimizing total weighted flow time of a set of jobs with interval processing times. 556-573 2009 50 Math. Comput. Model. 3-4 https://doi.org/10.1016/j.mcm.2009.03.006 db/journals/mcm/mcm50.html#SotskovEL09
Peter Brucker Yuri N. Sotskov Frank Werner 0001 Complexity of shop-scheduling problems with fixed number of jobs: a survey. 461-481 2007 65 Math. Methods Oper. Res. 3 https://doi.org/10.1007/s00186-006-0127-8 https://www.wikidata.org/entity/Q57633912 db/journals/mmor/mmor65.html#BruckerSW07
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. 1137-1148 2006 182 Appl. Math. Comput. 2 https://doi.org/10.1016/j.amc.2006.04.063 https://www.wikidata.org/entity/Q57717981 db/journals/amc/amc182.html#Al-AnziSAA06
Yuri N. Sotskov Alexandre Dolgui Marie-Claude Portmann Stability analysis of an optimal balance for an assembly line with fixed cycle time. 783-797 2006 168 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2004.07.028 db/journals/eor/eor168.html#SotskovDP06
Oliver Braun Natalja M. Leshchenko Yuri N. Sotskov Optimality of Jackson's permutations with respect to limited machine availability. 59-74 2006 13 Int. Trans. Oper. Res. 1 https://doi.org/10.1111/j.1475-3995.2006.00533.x db/journals/itor/itor13.html#BraunLS06
Tsung-Chyan Lai Yuri N. Sotskov Nadezhda Sotskova Frank Werner 0001 Mean flow time minimization with given bounds of processing times. 558-573 2004 159 Eur. J. Oper. Res. 3 https://doi.org/10.1016/S0377-2217(03)00424-7 https://www.wikidata.org/entity/Q57633931 db/journals/eor/eor159.html#LaiSSW04
Yuri N. Sotskov Ali Allahverdi Tsung-Chyan Lai Flowshop scheduling problem to minimize total completion time with random and bounded processing times. 277-286 2004 55 J. Oper. Res. Soc. 3 https://doi.org/10.1057/palgrave.jors.2601682 db/journals/jors/jors55.html#SotskovAL04
Jatinder N. D. Gupta Karin Krüger Volker Lauff Frank Werner 0001 Yuri N. Sotskov Heuristics for hybrid flow shops with controllable processing times and assignable due dates. 1417-1439 2002 29 Comput. Oper. Res. 10 https://doi.org/10.1016/S0305-0548(01)00040-5 https://www.wikidata.org/entity/Q57633939 db/journals/cor/cor29.html#GuptaKLWS02
Yuri N. Sotskov Alexandre Dolgui Stability radius of the optimal assembly line balance with fixed cycle time. 623-628 2001 ETFA (1) https://doi.org/10.1109/ETFA.2001.996422 conf/etfa/2001-1 db/conf/etfa/etfa2001-1.html#SotskovD01
Natalia V. Shakhlevich Yuri N. Sotskov Frank Werner 0001 Complexity of mixed shop scheduling problems: A survey. 343-351 2000 120 Eur. J. Oper. Res. 2 https://doi.org/10.1016/S0377-2217(99)00161-7 https://www.wikidata.org/entity/Q57633958 db/journals/eor/eor120.html#ShakhlevichSW00
Natalia V. Shakhlevich Yuri N. Sotskov Frank Werner 0001 Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs. 281-304 1999 92 Ann. Oper. Res. https://doi.org/10.1023/A%3A1018943016617 db/journals/anor/anor92.html#ShakhlevichSW99
Tsung-Chyan Lai Yuri N. Sotskov Sequencing with uncertain numerical data for makespan minimisation. 230-243 1999 50 J. Oper. Res. Soc. 3 https://doi.org/10.1057/palgrave.jors.2600690 db/journals/jors/jors50.html#LaiS99
Peter Brucker Svetlana A. Kravchenko Yuri N. Sotskov Preemptive job-shop scheduling problems with a fixed number of jobs. 41-76 1999 49 Math. Methods Oper. Res. 1 https://doi.org/10.1007/PL00020906 db/journals/mmor/mmor49.html#BruckerKS99
Yuri N. Sotskov Thomas Tautenhahn Frank Werner 0001 On the application of insertion techniques for job shop problems with setup times. 209-245 1999 33 RAIRO Oper. Res. 2 https://doi.org/10.1051/ro:1999110 https://www.wikidata.org/entity/Q57633966 db/journals/rairo/rairo33.html#SotskovTW99
Yuri N. Sotskov Albert P. M. Wagelmans Frank Werner 0001 On the calculation of the stability radiusof an optimal or an approximate schedule. 213-252 1998 83 Ann. Oper. Res. https://doi.org/10.1023/A%3A1018960030420 db/journals/anor/anor83.html#SotskovW098
Svetlana A. Kravchenko Yuri N. Sotskov Optimal makespan schedule for three jobs on two machines. 233-238 1996 43 Math. Methods Oper. Res. 2 https://doi.org/10.1007/BF01680374 db/journals/mmor/mmor43.html#KravchenkoS96
Yuri N. Sotskov Vladimir K. Leont'ev Evgenii N. Gordeev Some Concepts of Stability Analysis in Combinatorial optimization. 169-190 1995 58 Discret. Appl. Math. 2 https://doi.org/10.1016/0166-218X(93)E0126-J db/journals/dam/dam58.html#SotskovLG95
Yuri N. Sotskov Natalia V. Shakhlevich NP-hardness of Shop-scheduling Problems with Three Jobs. 237-266 1995 59 Discret. Appl. Math. 3 https://doi.org/10.1016/0166-218X(95)80004-N db/journals/dam/dam59.html#SotskovS95
Natalia V. Shakhlevich Yuri N. Sotskov Scheduling two jobs with fixed and nonfixed routes. 17-30 1994 52 Computing 1 https://doi.org/10.1007/BF02243393 db/journals/computing/computing52.html#ShakhlevichS94
Fawaz S. Al-Anzi Ali Allahverdi George V. Andreev Yulia S. Belotzkaya Oliver Braun Peter Brucker Larysa Burtseva T. C. E. ChengT. C. Edwin Cheng Alexandre Dolgui Andrei A. Efremov Natalja G. Egorova Omid Gholami Evgenii N. Gordeev Valery S. Gordon Jatinder N. D. Gupta Vadzim D. Hatsura Mikhail Y. Kovalyov Svetlana A. Kravchenko Karin Krüger Tsung-Chyan Lai Volker Lauff Vladimir K. Leont'ev Natalja M. Leshchenko G. M. Levin Natalja M. Matsveichuk Evangelina I. Mihova C. T. Ng 0001 Marie-Claude Portmann Yakov M. Shafransky Natalia V. Shakhlevich Nadezhda Sotskova Vitaly A. Strusevich Thomas Tautenhahn Alexander V. Tuzikov Albert P. M. Wagelmans Frank Werner 0001 Aksana Zatsiupa A. S. Zatsiupo