A unified approach to scheduling on unrelated parallel machines
From MaRDI portal
Publication:3452224
DOI10.1145/1552285.1552289zbMATH Open1325.90044OpenAlexW2015231501MaRDI QIDQ3452224FDOQ3452224
Authors: V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan, Madhav V. Marathe 
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1552285.1552289
Recommendations
- Approximating scheduling unrelated parallel machines in parallel
- Unrelated parallel machine scheduling -- perspectives and progress
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling on uniform nonsimultaneous parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Heuristics for scheduling unrelated parallel machines
- Automata, Languages and Programming
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Unrelated parallel machine scheduling with new criteria: complexity and models
Cited In (35)
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
- A desired load distribution model for scheduling of unrelated parallel machines
- Simpler and Better Algorithms for Minimum-Norm Load Balancing
- An almost ideal coordination mechanism for unrelated machine scheduling
- A scheduling problem with unrelated parallel machines and sequence dependent setups
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- An EPTAS for scheduling on unrelated machines of few different types
- Concentration inequalities for nonlinear matroid intersection
- Approximation algorithms for scheduling unrelated parallel machines
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
- Tight bounds for online vector scheduling
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- On the Configuration-LP for Scheduling on Unrelated Machines
- All-Norm Approximation Algorithms
- Approximation algorithms for clustering with dynamic points
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- Non-clairvoyantly scheduling to minimize convex functions
- Scheduling Unrelated Machines by Randomized Rounding
- Approximating weighted completion time via stronger negative correlation
- Graph balancing: a special case of scheduling unrelated parallel machines
- Automata, Languages and Programming
- Concentration inequalities for nonlinear matroid intersection
- Approximating scheduling unrelated parallel machines in parallel
- Fair scheduling via iterative quasi-uniform sampling
- Online scheduling with general cost functions
- Randomized rounding in the presence of a cardinality constraint
- Convex programming for scheduling unrelated parallel machines
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Unrelated machine scheduling of jobs with uniform Smith ratios
- Scheduling unrelated parallel machines with optional machines and jobs selection
This page was built for publication: A unified approach to scheduling on unrelated parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452224)
