The following pages link to (Q3994687):
Displaying 32 items.
- Two-directional traffic scheduling problem solution for a single-track railway with siding (Q517332) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Maximization of unit present profit in inventory management systems (Q827993) (← links)
- Financing and reliability analysis for schedules in the project calendar planning problem (Q893924) (← links)
- Scientific school of Academician V. S. Tanaev: results on the scheduling theory (Q893925) (← links)
- The problems of servicing of the binary object flow in system with refillable storage component (Q893927) (← links)
- The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- Stability of a routing optimization algorithm (Q1280902) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- Execution time of competing processes in distribution processing (Q1364108) (← links)
- On the minimal time required for execution of distributed concurrent processes in synchronous modes (Q1592085) (← links)
- Conditions for the existence of continuous schedules of duration five (Q1759070) (← links)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- Cybernetics and . . . (Conceptology of a cancelled science) (Q1907787) (← links)
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A heuristic method for solving integer-valued decompositional multiindex problems (Q2261778) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- On interval \(\Delta\)-coloring of bipartite graphs (Q2356135) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- On minimizing dataset transfer time in an acyclic network with four servers (Q2959189) (← links)
- On complexity of optimal recombination for flowshop scheduling problems (Q3186862) (← links)
- Some graph‐theoretical models for scheduling in automated production systems (Q4291473) (← links)
- (Q4323632) (← links)
- (Q4434437) (← links)
- Scheduling theory. Multi-stage systems. Transl. from the Russ. and updated by the authors (Q4841579) (← links)
- Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations (Q5039314) (← links)
- CHAIN STRUCTURES IN SCHEDULES TASKS (Q5150747) (← links)
