Makespan minimization on unrelated parallel machines with a few bags
From MaRDI portal
Publication:6049079
Recommendations
- Makespan minimization on unrelated parallel machines with a few bags
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Graph balancing: a special case of scheduling unrelated parallel machines
Cited in
(8)- A 3/2-approximation algorithm for the graph balancing problem with two weights
- Exact makespan minimization of unrelated parallel machines
- Makespan minimization on unrelated parallel machines with a few bags
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
- On min-max graph balancing with strict negative correlation constraints
This page was built for publication: Makespan minimization on unrelated parallel machines with a few bags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049079)