zbMath0673.90023MaRDI QIDQ3994687
Vyacheslav Tanaev, Yuri N. Sotskov, Vitaly A. Strusevich
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations,
Maximization of unit present profit in inventory management systems,
On some geometric methods in scheduling theory: A survey,
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches,
On complexity of optimal recombination for flowshop scheduling problems,
Execution time of competing processes in distribution processing,
Cybernetics and . . . (Conceptology of a cancelled science),
Financing and reliability analysis for schedules in the project calendar planning problem,
Scientific school of Academician V. S. Tanaev: results on the scheduling theory,
The problems of servicing of the binary object flow in system with refillable storage component,
On minimizing dataset transfer time in an acyclic network with four servers,
Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem,
Vyacheslav Tanaev: contributions to scheduling and related areas,
The complexity of shop-scheduling problems with two or three jobs,
Stability of an optimal schedule,
CHAIN STRUCTURES IN SCHEDULES TASKS,
Two-directional traffic scheduling problem solution for a single-track railway with siding,
Conditions for the existence of continuous schedules of duration five,
A heuristic method for solving integer-valued decompositional multiindex problems,
A polynomial algorithm for an open shop problem with unit processing times and tree constraints,
Some concepts of stability analysis in combinatorial optimization,
A review of four decades of time-dependent scheduling: main results, new topics, and open problems,
The flow shop problem with no-idle constraints: a review and approximation,
Stability of a routing optimization algorithm,
On the minimal time required for execution of distributed concurrent processes in synchronous modes,
A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem],
On interval \(\Delta\)-coloring of bipartite graphs
