Scheduling tree-structured tasks with restricted execution times

DOI10.1016/0020-0190(88)90206-2zbMath0658.68040OpenAlexW2019483472MaRDI QIDQ1111371

Joseph Y.-T. Leung, Jian-Zhong Du

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90206-2

zbMATH Keywords

multiprocessor schedulingNP-completenessNP-hardnessschedule lengthtree-structured task system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Scheduling of resource tasks ⋮ A note on minimum makespan assembly plans

Cites Work

• Bin packing with divisible item sizes
• NP-complete scheduling problems
• Optimal scheduling for two-processor systems
• On Scheduling Independent Tasks with Restricted Execution Times
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling tree-structured tasks with restricted execution times