1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DC2019★ 1 cited
Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space
Michael Orr, Oliver Sinnen
The problem of task scheduling with communication delays is strongly NP-hard. State-space search algorithms such as A* have been shown to be a promising approach to solving small t…
cs.DC2019
Optimal Task Scheduling Benefits From a Duplicate-Free State-Space
Michael Orr, Oliver Sinnen
The NP-hard problem of task scheduling with communication delays (P|prec,c_{ij}|C_{\mathrm{max}}) is often tackled using approximate methods, but guarantees on the quality of these…