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

DOI10.1137/0402016zbMath0672.90076MaRDI 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 scheduling; nonpreemptive scheduling; minimum length schedule; two identical processors; n tasks; tree- structured precedence relation

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Scheduling of resource tasks