Strong LP formulations for scheduling splittable jobs on unrelated machines
From MaRDI portal
(Redirected from Publication:896269)
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
Cites work
- scientific article; zbMATH DE number 5764883 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1305470 (Why is no real title available?)
- A survey of scheduling problems with setup times or costs
- A threshold of ln n for approximating set cover
- Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines
- Approximation algorithms for 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
- Geometric algorithms and combinatorial optimization
- Graph balancing: a special case of scheduling unrelated parallel machines
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Lot-sizing scheduling with batch setup times
- Minimizing total completion time subject to job release dates and preemption penalties
- New constructive aspects of the Lovász local lemma
- On the configuration-LP for scheduling on unrelated machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with splitting jobs
- Quasi-polynomial local search for restricted max-min fair allocation
- Santa claus meets hypergraph matchings
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Split scheduling with uniform setup times
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- The Santa Claus problem
- The design of approximation algorithms
Cited in
(13)- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- scientific article; zbMATH DE number 7650084 (Why is no real title available?)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- Approximating weighted completion time for order scheduling with setup times
- Malleable scheduling beyond identical machines
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- On the configuration-LP for scheduling on unrelated machines
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- 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
- scientific article; zbMATH DE number 7559087 (Why is no real title available?)
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)
