Pages that link to "Item:Q2819574"
From MaRDI portal
The following pages link to Improved approximation schemes for scheduling unrelated parallel machines (Q2819574):
Displaying 10 items.
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
