Pages that link to "Item:Q751989"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling unrelated parallel machines (Q751989):
Displaying 9 items.
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)
- On best-of-both-worlds fair-share allocations (Q6167252) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
- A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width (Q6487362) (← links)
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing (Q6556084) (← links)
- Approximation algorithms for job scheduling with block-type conflict graphs (Q6568400) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)
- Approximation schemes for machine scheduling (Q6606622) (← links)
- Time-sharing scheduling with tolerance capacities (Q6655677) (← links)