On the configuration-LP for scheduling on unrelated machines
From MaRDI portal
Publication:490331
DOI10.1007/S10951-013-0359-4zbMATH Open1305.68046OpenAlexW1605794186MaRDI QIDQ490331FDOQ490331
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0359-4
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation algorithms for scheduling unrelated parallel machines
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- The Santa Claus problem
- Santa Claus Schedules Jobs on Unrelated Machines
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- On Allocating Goods to Maximize Fairness
- MaxMin allocation via degree lower-bounded arborescences
- An optimal rounding gives a better approximation for scheduling unrelated machines
- The power of preemption on unrelated machines and applications to scheduling orders
- Santa Claus Meets Hypergraph Matchings
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- On the Configuration-LP for Scheduling on Unrelated Machines
- Santa claus meets hypergraph matchings
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- New Constructive Aspects of the Lovász Local Lemma
- A note on graph balancing problems with restrictions
Cited In (20)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- An EPTAS for scheduling on unrelated machines of few different types
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- On the Configuration-LP for Scheduling on Unrelated Machines
- Optimal matroid partitioning problems
- Parameterized orientable deletion
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- Title not available (Why is that?)
- Strong LP formulations for scheduling splittable jobs on unrelated machines
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- Semidefinite and linear programming integrality gaps for scheduling identical machines
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths
- Better trees for Santa Claus
- Title not available (Why is that?)
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- Compact LP Relaxations for Allocation Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the configuration-LP for scheduling on unrelated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490331)
