A unified approach to scheduling on unrelated parallel machines

DOI10.1145/1552285.1552289MaRDI QIDQ3452224zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmsrandomized roundingscheduling under multiple criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

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

(32)

• 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
• 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
• 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
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Tight bounds for online vector scheduling
• On the Configuration-LP for Scheduling on Unrelated Machines
• All-Norm Approximation Algorithms
• Approximation algorithms for clustering with dynamic points
• Non-clairvoyantly scheduling to minimize convex functions
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
• 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
• Randomized rounding in the presence of a cardinality constraint
• Online scheduling with general cost functions
• 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)