Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length

DOI10.1137/0402016zbMath0672.90076OpenAlexW2078795041MaRDI QIDQ3826356

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

Publication date: 1989

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

multiprocessor schedulingnonpreemptive schedulingminimum length scheduletwo identical processorsn taskstree- structured precedence relation

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling of resource tasks

This page was built for publication: Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length