Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal

DOI10.1016/j.jcss.2008.04.001zbMath1152.68012OpenAlexW2019712172MaRDI QIDQ955345

Devdatta Gangal, Abhiram G. Ranade

Publication date: 19 November 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2008.04.001

zbMATH Keywords

approximation algorithmdeadlineprecedence constrained scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (4)

Towards Tight Lower Bounds for Scheduling Problems ⋮ Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling ⋮ Quasi-PTAS for scheduling with precedences using LP hierarchies ⋮ A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies

Cites Work

• Optimal scheduling for two-processor systems
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Complexity of Scheduling under Precedence Constraints
• Worst Case Analysis of Two Scheduling Algorithms
• A New Insight into the Coffman–Graham Algorithm
• Optimal Sequencing of Two Equivalent Processors

This page was built for publication: Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal