Pages that link to "Item:Q1145998"
From MaRDI portal
The following pages link to Efficient scheduling of tasks without full use of processor resources (Q1145998):
Displaying 7 items.
- An improved monotone algorithm for scheduling related machines with precedence constraints (Q408428) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
