Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors

DOI10.1016/j.endm.2010.05.100zbMath1237.90141OpenAlexW1983452345MaRDI QIDQ2883650

Abir Benabid, Claire Hanen

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.100

zbMATH Keywords

scheduling theoryworst-case analysismaximum latenessdedicated processorsunit execution timesprecedence delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The resource-constrained modulo scheduling problem: an experimental study

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• An iterative algorithm for scheduling UET tasks with due dates and release times.
• Performance of Garey-Johnson algorithm for pipelined typed tasks systems
• Complexity of Scheduling under Precedence Constraints
• A New Insight into the Coffman–Graham Algorithm