The complexity of a multiprocessor task assignment problem without deadlines

DOI10.1016/0304-3975(82)90005-6MaRDI QIDQ1155958zbMATH OpenOpenAlexFDO

Authors Ronald D. Dutton, Robert 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

• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Some simplified NP-complete graph problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155958)