Strong LP formulations for scheduling splittable jobs on unrelated machines
DOI10.1007/S10107-014-0831-8zbMATH Open1327.90067DBLPjournals/mp/CorreaMMSSVV15OpenAlexW2164915638WikidataQ65553897 ScholiaQ65553897MaRDI QIDQ896269FDOQ896269
Authors: José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, L. Stougie, Ola Svensson, Víctor Verdugo, José Verschae 
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/23272
Recommendations
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- On the Configuration-LP for Scheduling on Unrelated Machines
- On the configuration-LP for scheduling on unrelated machines
- On the configuration-LP of the restricted assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Integer programming (90C10)
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- The design of approximation algorithms
- Geometric algorithms and combinatorial optimization
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Graph balancing: a special case of scheduling unrelated parallel machines
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A survey of scheduling problems with setup times or costs
- Approximation algorithms for scheduling unrelated parallel machines
- Minimizing total completion time subject to job release dates and preemption penalties
- The Santa Claus problem
- Parallel machine scheduling with splitting jobs
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Santa claus meets hypergraph matchings
- On the configuration-LP for scheduling on unrelated machines
- New constructive aspects of the Lovász local lemma
- Quasi-polynomial local search for restricted max-min fair allocation
- Lot-sizing scheduling with batch setup times
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- Split scheduling with uniform setup times
- Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines
Cited In (13)
- Title not available (Why is that?)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- Malleable scheduling beyond identical machines
- Approximating weighted completion time for order scheduling with setup times
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- On the configuration-LP for scheduling on unrelated machines
- Semidefinite and linear programming integrality gaps for scheduling identical machines
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Scheduling cleaning activities on trains by minimizing idle times
- Title not available (Why is that?)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
This page was built for publication: Strong LP formulations for scheduling splittable jobs on unrelated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896269)
