Pages that link to "Item:Q1267552"
From MaRDI portal
The following pages link to A relation between multiprocessor scheduling and linear programming (Q1267552):
Displaying 8 items.
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results (Q3598041) (← links)
- Logic versus Approximation (Q5712371) (← links)