default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYakov M. Shafransky
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
Journal Articles
- 2020
[j16]Ilia Fridman, Erwin Pesch, Yakov M. Shafransky:
Minimizing maximum cost for a single machine under uncertainty of processing times. Eur. J. Oper. Res. 286(2): 444-457 (2020)- [j15]Yakov M. Shafransky, Viktor Shinkarevich:
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty. J. Sched. 23(6): 745-749 (2020) - 2017
- [j14]Nadia Brauner
, Gerd Finke, Yakov M. Shafransky:
Lawler's minmax cost problem under uncertainty. J. Comb. Optim. 34(1): 31-46 (2017) - 2016
- [j13]T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng:
An alternative approach for proving the NP-hardness of optimization problems. Eur. J. Oper. Res. 248(1): 52-58 (2016) - [j12]Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Scheduling dedicated jobs with variative processing times. J. Comb. Optim. 31(2): 774-785 (2016) - [j11]Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu:
Lawler's minmax cost algorithm: optimality conditions and uncertainty. J. Sched. 19(4): 401-408 (2016) - 2015
- [j10]Maksim Barketau, Erwin Pesch, Yakov M. Shafransky:
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. Discret. Appl. Math. 196: 4-19 (2015) - 2014
- [j9]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) - 2012
- [j8]Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich:
Editorial: new branches, old roots. J. Sched. 15(4): 399-401 (2012) - [j7]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) - 2006
- [j6]Yakov M. Shafransky, Alexander A. Doudkin:
An optimization algorithm for the clearing of interbank payments. Eur. J. Oper. Res. 171(3): 743-749 (2006) - 2004
- [j5]Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich:
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. J. Comb. Optim. 8(1): 13-28 (2004) - 2001
- [j4]Adam Janiak, Yakov M. Shafransky, Alexander Tuzikov:
Sequencing with Ordered Criteria, Precedence and Group Technology Constraints. Informatica 12(1): 61-88 (2001) - 1998
- [j3]Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner:
Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83: 23-40 (1998) - [j2]Mikhail Y. Kovalyov, Yakov M. Shafransky:
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints. Discret. Appl. Math. 84(1-3): 253-257 (1998) - 1997
- [j1]Mikhail Y. Kovalyov, Yakov M. Shafransky:
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. Inf. Process. Lett. 64(2): 69-74 (1997)
Conference and Workshop Papers
- 2005
- [c1]Yakov M. Shafransky:
Scheduling Jobs with Uncertain Parameters: Analysis of Research Directions. OR 2005: 709-714
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 2025-01-09 13:09 CET 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:
