Get started
Author

Yakov M. Shafransky

Observed names: Shafransky, Yakov, Y. M. Shafransky, Y. Shafransky, Y.M. Shafransky, Ya. M. Shafransky, Yakov Shafransky
ORCID: 0000-0001-5381-3222
Observed ORCID: 0000-0001-5381-3222
OpenAlex ID: A5045385682
Scheduling Theory. Single-Stage Systems
1994 · V. S. Tanaev, V. S. Gordon, et al. · Springer eBooks · 143
Scheduling for parallel dedicated machines with a single server
2000 · Celia A. Glass, Yakov M. Shafransky, et al. · Naval Research Logistics (NRL) · 70
Batch scheduling with deadlines on parallel machines
1998 · Peter Brucker, Mikhail Y. Kovalyov, et al. · Annals of Operations Research · 34
The open shop scheduling problem with a given sequence of jobs on one machine
1998 · Y.M. Shafransky, V.A. Strusevich · Naval Research Logistics (NRL) · 30
An optimization algorithm for the clearing of interbank payments
2005 · Yakov M. Shafransky, Alexander A. Doudkin · European Journal of Operational Research · 23
NP-Hard Problems
1994 · V. S. Tanaev, V. S. Gordon, et al. · Springer eBooks · 19
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
2015 · Maksim Barketau, Erwin Pesch, et al. · Discrete Applied Mathematics · 17
PDF
Uniform machine scheduling of unit-time jobs subject to resource constraints
1998 · Mikhail Y. Kovalyov, Yakov M. Shafransky · Discrete Applied Mathematics · 15
PDF
Sequencing with Ordered Criteria, Precedence and Group Technology Constraints
2001 · Adam Janiak, Yakov M. Shafransky, et al. · 11
Minimizing maximum cost for a single machine under uncertainty of processing times
2020 · Ilia Fridman, Erwin Pesch, et al. · European Journal of Operational Research · 10
Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints
2004 · A.A. Gladky, Y.M. Shafransky, et al. · Journal of Combinatorial Optimization · 10
An alternative approach for proving the NP-hardness of optimization problems
2015 · T.C.E. Cheng, Y. Shafransky, et al. · European Journal of Operational Research · 8
Scheduling for parallel dedicated machines with a single server
2000 · Celia A. Glass, Yakov M. Shafransky, et al. · Naval Research Logistics (NRL) · 7
Batch scheduling with deadlines on parallel machines: An NP-hard case
1997 · Mikhail Y. Kovalyov, Yakov M. Shafransky · Information Processing Letters · 7
Lawler’s minmax cost algorithm: optimality conditions and uncertainty
2015 · Nadia Brauner, Gerd Finke, et al. · Journal of Scheduling · 6
Scheduling dedicated jobs with variative processing times
2014 · Maksim Barketau, Erwin Pesch, et al. · Journal of Combinatorial Optimization · 6
Lawler’s minmax cost problem under uncertainty
2016 · Nadia Brauner, Gerd Finke, et al. · Journal of Combinatorial Optimization · 3
Vyacheslav Tanaev: contributions to scheduling and related areas
2011 · V. S. Gordon, M. Y. Kovalyov, et al. · Journal of Scheduling · 3
A note on the complexity of family scheduling to minimize the number of late jobs
2001 · T. C. Edwin Cheng, Zhaohui Liu, et al. · Journal of Scheduling · 2
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
2020 · Yakov Shafransky, Viktor Shinkarevich · Journal of Scheduling · 1
The open shop scheduling problem with a given sequence of jobs on one machine
1998 · Y.M. Shafransky, V.A. Strusevich · Naval Research Logistics (NRL) · 1
Polynomially Solvable Problems
1994 · V. S. Tanaev, V. S. Gordon, et al. · Springer eBooks · 1
Clearing in financial networks with constrained equal awards
2024 · Ya. M. Shafransky · Informatics
PDF
An approach for proving the NP-hardness of optimization problems with hard computable objectives
2016 · Yakov M. Shafransky, T-C. Edwin Cheng, et al. · International Workshop on Dynamic Scheduling Problems (IWDSP)
PDF
Scientific school of Academician V. S. Tanaev: Results on the scheduling theory
2014 · M. Y. Kovalyov, Yu. N. Sotskov, et al. · Automation and Remote Control
Works count: 34
Citation count: 427
H-index: 10
I10-index: 11
Year
Topic
Type