Upper bound of the duration of the shortest schedule in one class of Hu problems

DOI10.1007/BF01075108zbMath0454.68013MaRDI QIDQ3902465

A. I. Kuksa

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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

Cites Work

• NP-complete scheduling problems
• Optimal Sequencing of Two Equivalent Processors
• Unnamed Item