Tight performance bounds of CP-scheduling on out-trees

DOI10.1023/A:1011676725533zbMATH Open0990.68026OpenAlexW1545223568MaRDI QIDQ5952053

Nodari Vakhania

Publication date: 14 August 2002

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011676725533

zbMATH Keywords

multiprocessor schedulingremainderrelease timescheduling identical processorstree-type precedence relationsworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Tight performance bounds of CP-scheduling on out-trees

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