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

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

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

This page was built for publication: Upper bound of the duration of the shortest schedule in one class of Hu problems