New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming: Series A and B
NP-hardness of shop-scheduling problems with three jobs
Discrete Applied Mathematics
Some concepts of stability analysis in combinatorial optimization
Proceedings of the workshop on Discrete algorithms
Uniform machine scheduling of unit-time jobs subject to resource constraints
Discrete Applied Mathematics
Earliness penalties on a single machine subject to precedence constraints
Computers and Operations Research
Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
Combinatorial optimization with rational objective functions
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Sequencing and Scheduling in Robotic Cells: Recent Developments
Journal of Scheduling
Coloring some classes of mixed graphs
Discrete Applied Mathematics
On two coloring problems in mixed graphs
European Journal of Combinatorics
Hi-index | 0.00 |
This paper discusses several areas of research conducted by Vyacheslav Tanaev (1940---2002), mainly on scheduling. His contribution to the parametric decomposition of optimization problems is also addressed. For each area we focus on the most important results obtained by V.S. Tanaev and trace how his research has been advanced.