Pages that link to "Item:Q2489902"
From MaRDI portal
The following pages link to Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902):
Displaying 7 items.
- The corridor allocation problem (Q339697) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
