Pages that link to "Item:Q5961071"
From MaRDI portal
The following pages link to Approximating scheduling unrelated parallel machines in parallel (Q5961071):
Displaying 15 items.
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- Convex programming for scheduling unrelated parallel machines (Q3581397) (← links)
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3789320) (← links)
- (Q4536969) (← links)
- (Q4801952) (← links)
- A desired load distribution model for scheduling of unrelated parallel machines (Q5478812) (← links)
- Complexity of preemptive minsum scheduling on unrelated parallel machines (Q5704855) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Bag-Of-Tasks Scheduling on Related Machines (Q6070373) (← links)