On minimizing the makespan when some jobs cannot be assigned on the same machine
From MaRDI portal
Publication:5111718
Recommendations
- 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
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling parallel jobs to minimize the makespan
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling independent tasks to minimize the makespan on identical machines
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
Cites work
- scientific article; zbMATH DE number 1305407 (Why is no real title available?)
- scientific article; zbMATH DE number 6820261 (Why is no real title available?)
- A quasi-polynomial approximation for the restricted assignment problem
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximating the multi-level bottleneck assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- Bin packing with restricted piece sizes
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Estimating the makespan of the two-valued restricted assignment problem
- Graph balancing: a special case of scheduling unrelated parallel machines
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On \((1,\varepsilon)\)-restricted assignment makespan minimization
- On the configuration-LP for scheduling on unrelated machines
- Scheduling with conflicts: Online and offline algorithms
- Scheduling with incompatible jobs
- Solving an avionics real-time scheduling problem by advanced IP-methods
Cited in
(12)- Makespan minimization on unrelated parallel machines with a few bags
- An APTAS for bin packing with clique-graph conflicts
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- The 2-valued case of makespan minimization with assignment constraints
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Makespan minimization on unrelated parallel machines with a few bags
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
- Scheduling with machine conflicts
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Scheduling parallel jobs to minimize the makespan
- Approximation algorithms for job scheduling with block-type conflict graphs
- Scheduling on uniform machines with a conflict graph: complexity and resolution
This page was built for publication: On minimizing the makespan when some jobs cannot be assigned on the same machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111718)
