New applications of the Muntz and Coffma
✍
Maciej Drozdowski
📂
Article
📅
2001
🏛
Springer US
🌐
English
⚖ 214 KB
Muntz and Co man proposed an algorithm to solve the problem of scheduling preemptable tasks either with arbitrary precedences on two processors, or tasks with tree-like precedences on an arbitrary number of processors, for the schedule length criterion. In this work, we demonstrate that this well-kn