Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMATH Open1142.90403OpenAlexW2649657569MaRDI QIDQ5479366FDOQ5479366

Authors: V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan, Madhav V. Marathe 

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538462

Recommendations

• Scheduling on unrelated machines under tree-like precedence constraints
• scientific article
• Approximation techniques for average completion time scheduling
• Approximation schemes for scheduling jobs with chain precedence constraints
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

Mathematics Subject Classification ID

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

Cited In (8)

• Scheduling on unrelated machines under tree-like precedence constraints
• Approximation schemes for scheduling jobs with chain precedence constraints
• On Stochastic Scheduling with In-Tree Precedence Constraints
• A new heuristic and an exact approach for a production planning problem
• Approximation algorithms for multiprocessor scheduling under uncertainty
• Machine scheduling with resource dependent processing times
• The power of preemption on unrelated machines and applications to scheduling orders
• Chains and trees: `Strong' -- `weak' order in job scheduling

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479366)