Yu. N. Sotskov

555 total citations
20 papers, 430 citations indexed

About

Yu. N. Sotskov is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Control and Systems Engineering. According to data from OpenAlex, Yu. N. Sotskov has authored 20 papers receiving a total of 430 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Industrial and Manufacturing Engineering, 7 papers in Computer Networks and Communications and 3 papers in Control and Systems Engineering. Recurrent topics in Yu. N. Sotskov's work include Scheduling and Optimization Algorithms (18 papers), Advanced Manufacturing and Logistics Optimization (10 papers) and Optimization and Packing Problems (8 papers). Yu. N. Sotskov is often cited by papers focused on Scheduling and Optimization Algorithms (18 papers), Advanced Manufacturing and Logistics Optimization (10 papers) and Optimization and Packing Problems (8 papers). Yu. N. Sotskov collaborates with scholars based in Belarus, Germany and Taiwan. Yu. N. Sotskov's co-authors include Natalia V. Shakhlevich, Tsung-Chyan Lai, Frank Werner, Peter Brucker and Svetlana A. Kravchenko and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Mathematical and Computer Modelling.

In The Last Decade

Yu. N. Sotskov

20 papers receiving 381 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Yu. N. Sotskov Belarus	10	375	111	44	36	34	20	430
Irfan M. Ovacik United States	10	597 1.6×	159 1.4×	41 0.9×	36 1.0×	74 2.2×	15	639
Manzhan Gu China	9	235 0.6×	100 0.9×	35 0.8×	27 0.8×	16 0.5×	21	331
Hongfeng Jia Singapore	5	353 0.9×	71 0.6×	53 1.2×	17 0.5×	17 0.5×	7	390
Luis Fanjul-Peyro Spain	8	532 1.4×	126 1.1×	27 0.6×	20 0.6×	28 0.8×	8	573
Fuh‐Der Chou Taiwan	10	270 0.7×	58 0.5×	30 0.7×	15 0.4×	17 0.5×	34	351
T. X. Cai Singapore	5	259 0.7×	42 0.4×	34 0.8×	18 0.5×	14 0.4×	14	330
Sanjiv Sarin United States	9	224 0.6×	43 0.4×	17 0.4×	36 1.0×	11 0.3×	29	302
Hande Öztop Türkiye	11	325 0.9×	57 0.5×	31 0.7×	21 0.6×	6 0.2×	20	368
J. Erschler France	10	267 0.7×	100 0.9×	47 1.1×	71 2.0×	39 1.1×	21	328
Junwen Ding China	9	297 0.8×	53 0.5×	37 0.8×	15 0.4×	10 0.3×	21	371

Countries citing papers authored by Yu. N. Sotskov

Since Specialization

Citations

This map shows the geographic impact of Yu. N. Sotskov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yu. N. Sotskov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yu. N. Sotskov more than expected).

Fields of papers citing papers by Yu. N. Sotskov

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yu. N. Sotskov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yu. N. Sotskov. The network helps show where Yu. N. Sotskov may publish in the future.

Co-authorship network of co-authors of Yu. N. Sotskov

This figure shows the co-authorship network connecting the top 25 collaborators of Yu. N. Sotskov. A scholar is included among the top collaborators of Yu. N. Sotskov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yu. N. Sotskov. Yu. N. Sotskov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Sotskov, Yu. N.. (2020). Optimality Region for Job Permutation in Single-Machine Scheduling with Uncertain Processing Times. Automation and Remote Control. 81(5). 819–842. 1 indexed citations

Sotskov, Yu. N., et al.. (2014). A neural network algorithm for servicing jobs with sequential and parallel machines. Automation and Remote Control. 75(7). 1203–1220. 5 indexed citations

Sotskov, Yu. N., et al.. (2014). Stability polyhedra of optimal permutation of jobs servicing. Automation and Remote Control. 75(7). 1267–1282. 1 indexed citations

Sotskov, Yu. N. & Tsung-Chyan Lai. (2011). Minimizing total weighted flow time under uncertainty using dominance and a stability box. Computers & Operations Research. 39(6). 1271–1289. 30 indexed citations

Sotskov, Yu. N., et al.. (2010). Minimizing total weighted completion time with uncertain data: A stability approach. Automation and Remote Control. 71(10). 2038–2057. 9 indexed citations

Sotskov, Yu. N., et al.. (2009). Minimizing total weighted flow time of a set of jobs with interval processing times. Mathematical and Computer Modelling. 50(3-4). 556–573. 34 indexed citations

Sotskov, Yu. N., et al.. (2008). Schedule execution for two-machine flow-shop with interval processing times. Mathematical and Computer Modelling. 49(5-6). 991–1011. 36 indexed citations

Brucker, Peter, Yu. N. Sotskov, & Frank Werner. (2007). Complexity of shop-scheduling problems with fixed number of jobs: a survey. Mathematical Methods of Operations Research. 65(3). 461–481. 36 indexed citations

Sotskov, Yu. N.. (1997). Mixed multigraph approach to scheduling jobs on machines of different types^∗. Optimization. 42(3). 245–280. 7 indexed citations

10.

Sotskov, Yu. N., et al.. (1996). Stability of a schedule minimizing mean flow time. Mathematical and Computer Modelling. 24(10). 39–53. 23 indexed citations

11.

Sotskov, Yu. N., et al.. (1995). Some concepts of stability analysis in combinatorial optimization. Discrete Applied Mathematics. 58(2). 169–190. 84 indexed citations

12.

Kravchenko, Svetlana A., Yu. N. Sotskov, & Frank Werner. (1995). Optimal schedules with infinitely large stability radius^∗. Optimization. 33(3). 271–280. 18 indexed citations

13.

Sotskov, Yu. N. & Natalia V. Shakhlevich. (1995). NP-hardness of shop-scheduling problems with three jobs. Discrete Applied Mathematics. 59(3). 237–266. 64 indexed citations

14.

Sotskov, Yu. N., et al.. (1994). Scheduling theory and practice: Minsk group results. 3(1). 1–1. 3 indexed citations

15.

Sotskov, Yu. N.. (1994). An adaptive approach in production scheduling based on the mixed graph model. 1994. 413–418. 1 indexed citations

16.

Shakhlevich, Natalia V. & Yu. N. Sotskov. (1994). Scheduling two jobs with fixed and nonfixed routes. Computing. 52(1). 17–30. 10 indexed citations

17.

Sotskov, Yu. N.. (1993). The stability of the approximate Boolean minimization of a linear form. Computational Mathematics and Mathematical Physics. 33(5). 699–707. 5 indexed citations

18.

Sotskov, Yu. N.. (1991). Complexity of optimal scheduling problems with three jobs. Cybernetics and Systems Analysis. 26(5). 686–692. 2 indexed citations

19.

Sotskov, Yu. N.. (1991). The complexity of shop-scheduling problems with two or three jobs. European Journal of Operational Research. 53(3). 326–336. 58 indexed citations

20.

Sotskov, Yu. N.. (1989). The stability of high-speed optimal schedules. USSR Computational Mathematics and Mathematical Physics. 29(3). 57–63. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact