On minimizing the makespan when some jobs cannot be assigned on the same machine
From MaRDI portal
Publication:5111718
DOI10.4230/LIPICS.ESA.2017.31zbMATH Open1442.90071OpenAlexW2759616628MaRDI QIDQ5111718FDOQ5111718
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2017.31
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
- Graph balancing: a special case of scheduling unrelated parallel machines
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Approximation algorithms for scheduling unrelated parallel machines
- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
- Santa Claus Schedules Jobs on Unrelated Machines
- Scheduling with conflicts: Online and offline algorithms
- Title not available (Why is that?)
- Scheduling with incompatible jobs
- 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
- Bin packing with restricted piece sizes
- On the configuration-LP for scheduling on unrelated machines
- On (1,∊)-Restricted Assignment Makespan Minimization
- Title not available (Why is that?)
- A quasi-polynomial approximation for the restricted assignment problem
- Estimating The Makespan of The Two-Valued Restricted Assignment Problem
Cited In (11)
- Scheduling with machine conflicts
- An APTAS for bin packing with clique-graph conflicts
- Approximation algorithms for job scheduling with block-type conflict graphs
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
- Makespan minimization on unrelated parallel machines with a few bags
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- Makespan minimization on unrelated parallel machines with a few bags
- Scheduling parallel jobs to minimize the makespan
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)
