Yakov M. Shafransky

Affiliations:
  • National Academy of Sciences of Belarus, Minsk, Belarus


According to our database1, Yakov M. Shafransky authored at least 17 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty.
J. Sched., 2020

Minimizing maximum cost for a single machine under uncertainty of processing times.
Eur. J. Oper. Res., 2020

2017
Lawler's minmax cost problem under uncertainty.
J. Comb. Optim., 2017

2016
Lawler's minmax cost algorithm: optimality conditions and uncertainty.
J. Sched., 2016

Scheduling dedicated jobs with variative processing times.
J. Comb. Optim., 2016

An alternative approach for proving the NP-hardness of optimization problems.
Eur. J. Oper. Res., 2016

2015
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph.
Discret. Appl. Math., 2015

2014
Scientific school of Academician V. S. Tanaev: Results on the scheduling theory.
Autom. Remote. Control., 2014

2012
Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched., 2012

Editorial: new branches, old roots.
J. Sched., 2012

2006
An optimization algorithm for the clearing of interbank payments.
Eur. J. Oper. Res., 2006

2005
Scheduling Jobs with Uncertain Parameters: Analysis of Research Directions.
Proceedings of the Operations Research Proceedings 2005, 2005

2004
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints.
J. Comb. Optim., 2004

2001
Sequencing with Ordered Criteria, Precedence and Group Technology Constraints.
Informatica, 2001

1998
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints.
Discret. Appl. Math., 1998

Batch scheduling with deadlines on parallel machines.
Ann. Oper. Res., 1998

1997
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case.
Inf. Process. Lett., 1997


  Loading...