The complexity of a multiprocessor task assignment problem without deadlines

DOI10.1016/0304-3975(82)90005-6zbMath0467.68041OpenAlexW2058385076MaRDI QIDQ1155958

Ronald D. Dutton, Robert C. Brigham

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90005-6

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cites Work

• Some simplified NP-complete graph problems
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of a multiprocessor task assignment problem without deadlines