On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints

DOI10.1080/01969727508546102zbMATH Open0332.68043OpenAlexW1989054973MaRDI QIDQ4098657FDOQ4098657

Authors: Oscar H. Ibarra, Chul Eung Kim 

Publication date: 1976

Published in: Journal of Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969727508546102

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited In (3)

• List scheduling algorithms to minimize the makespan on identical parallel machines
• Methods for task allocation via agent coalition formation
• A state-of-the-art review of parallel-machine scheduling research

This page was built for publication: On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints

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