| Scheduling theory. Single-stage systems V Tanaev, W Gordon, YM Shafransky Springer Science & Business Media, 2012 | 483 | 2012 |
| Scheduling for parallel dedicated machines with a single server CA Glass, YM Shafransky, VA Strusevich Naval Research Logistics (NRL) 47 (4), 304-328, 2000 | 98 | 2000 |
| Batch scheduling with deadlines on parallel machines P Brucker, MY Kovalyov, YM Shafransky, F Werner Annals of Operations Research 83, 23-40, 1998 | 51 | 1998 |
| Parametric problem in scheduling theory OI Mel'nikov, YM Shafranskii Cybernetics 15 (3), 352-357, 1979 | 40 | 1979 |
| The open shop scheduling problem with a given sequence of jobs on one machine YM Shafransky, VA Strusevich Naval Research Logistics (NRL) 45 (7), 705-731, 1998 | 38 | 1998 |
| An optimization algorithm for the clearing of interbank payments YM Shafransky, AA Doudkin European Journal of Operational Research 171 (3), 743-749, 2006 | 27 | 2006 |
| Approximation Scheduling Algorithms: A Survey MY Kovalev, YM Shafranskij, VA Strusevich, VS Tanaev, AV Tuzikov Optimization 20 (6), 859-878, 1989 | 25 | 1989 |
| Minimizing maximum weight of subsets of a maximum matching in a bipartite graph M Barketau, E Pesch, Y Shafransky Discrete Applied Mathematics 196, 4-19, 2015 | 22 | 2015 |
| Uniform machine scheduling of unit-time jobs subject to resource constraints MY Kovalyov, YM Shafransky Discrete Applied Mathematics 84 (1-3), 253-257, 1998 | 22 | 1998 |
| Batch scheduling with deadlines on parallel machines: An NP-hard case MY Kovalyov, YM Shafransky Information processing letters 64 (2), 69-74, 1997 | 16 | 1997 |
| Sequencing with ordered criteria, precedence and group technology constraints A Janiak, Y Shafransky, A Tuzikov Informatica 12 (1), 61-88, 2001 | 15 | 2001 |
| Scheduling theory. Group technologies VS Tanaev, MY Kovalyov, YM Shafransky Minsk, IEC NANB, 41-44, 1998 | 12 | 1998 |
| Flow shop scheduling problems under machine–dependent precedence constraints AA Gladky, YM Shafransky, VA Strusevich Journal of combinatorial optimization 8, 13-28, 2004 | 11 | 2004 |
| Parallel machine deadline batch scheduling P Brucker, MY Kovalyov, YM Shafransky, F Werner Update 1998, 12-07, 1998 | 10 | 1998 |
| An alternative approach for proving the NP-hardness of optimization problems TCE Cheng, Y Shafransky, CT Ng European Journal of Operational Research 248 (1), 52-58, 2016 | 9 | 2016 |
| Theory of schedules. Singlestage systems VS Tanaev, VC Gordon, YM Shafranskij Moscow: Science. Main edition of physical and mathematical literature, 1984 | 8 | 1984 |
| Minimizing maximum cost for a single machine under uncertainty of processing times I Fridman, E Pesch, Y Shafransky European Journal of Operational Research 286 (2), 444-457, 2020 | 7 | 2020 |
| Teoriya raspisanii. Gruppovye tekhnologii VS Tanaev, MY Kovalyov, YM Shafransky ITK, 1998 | 7 | 1998 |
| Lawler’s minmax cost algorithm: optimality conditions and uncertainty N Brauner, G Finke, Y Shafransky, D Sledneu Journal of Scheduling 19, 401-408, 2016 | 6 | 2016 |
| A note on the complexity of family scheduling to minimize the number of late jobs TC Edwin Cheng, Z Liu, YM Shafransky Journal of Scheduling 4 (4), 225-229, 2001 | 5 | 2001 |
Mikhail Y. KovalyovUnited Institute of Informatics Problems, National Academy of Sciences of BelarusVerified email at newman.bas-net.by
