A New Insight into the Coffman–Graham Algorithm

DOI10.1137/S0097539790181889zbMath0827.90069OpenAlexW1994739878MaRDI QIDQ4302291

Bertrand Braschi, Denis Trystram

Publication date: 14 August 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539790181889

zbMATH Keywords

list schedulingprecedence graphidentical processorsworst case behaviorCoffman-Graham algorithmnonpreemptable tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors ⋮ An iterative algorithm for scheduling UET tasks with due dates and release times. ⋮ Scheduling loosely connected task graphs. ⋮ Performance of Garey-Johnson algorithm for pipelined typed tasks systems ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal ⋮ The worst-case analysis of the Garey-Johnson algorithm ⋮ Algorithms for dynamic scheduling of unit execution time tasks

This page was built for publication: A New Insight into the Coffman–Graham Algorithm