Scheduling with precedence constraints: Worst-case analysis of priority algorithms

DOI10.1017/S0004972700033827zbMath1026.90507OpenAlexW2046705689MaRDI QIDQ4709806

Gaurav Singh

Publication date: 8 December 2003

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700033827

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
• Performance of critical path type algorithms for scheduling on parallel processors

This page was built for publication: Scheduling with precedence constraints: Worst-case analysis of priority algorithms