The following pages link to (Q3994687):
Displayed 13 items.
- 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)