Pages that link to "Item:Q2373738"
From MaRDI portal
The following pages link to A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738):
Displaying 15 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds (Q1953222) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Task swapping networks in distributed systems (Q2874305) (← links)
- Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
