Pages that link to "Item:Q4511608"
From MaRDI portal
The following pages link to A new formulation for scheduling unrelated processor under precedence constraints (Q4511608):
Displaying 4 items.
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)