Scheduling on unrelated machines under tree-like precedence constraints
From MaRDI portal
Publication:2391177
DOI10.1007/S00453-007-9004-YzbMATH Open1180.90112OpenAlexW2173690244MaRDI QIDQ2391177FDOQ2391177
Authors: V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan 
Publication date: 24 July 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9004-y
Recommendations
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 1187166
- Approximation algorithms for scheduling with resource and precedence constraints
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Randomized algorithms (68W20) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Cites Work
- Convex quadratic and semidefinite programming relaxations in scheduling
- Title not available (Why is that?)
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Approximation algorithms for shop scheduling problems with minsum objective
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Improved Approximation Algorithms for Shop Scheduling Problems
- Title not available (Why is that?)
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- An efficient approximation algorithm for minimizing makespan on uniformly related machines.
- On dependent randomized rounding algorithms
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Parallel Processing and Applied Mathematics
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Title not available (Why is that?)
- Better approximation guarantees for job-shop scheduling
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
Cited In (10)
- Parallel dedicated machines scheduling with chain precedence constraints
- An improved approximation algorithm for scheduling under arborescence precedence constraints
- Approximation schemes for scheduling jobs with chain precedence constraints
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- The power of preemption on unrelated machines and applications to scheduling orders
- Chains and trees: `Strong' -- `weak' order in job scheduling
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
- Tree precedence in scheduling: The strong-weak distinction
- Approximation algorithms for scheduling with resource and precedence constraints
- Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
This page was built for publication: Scheduling on unrelated machines under tree-like precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391177)
