most citedNear Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2020★ 1 cited

Near Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes

Anne Ejsing, Martin Jensen, Marco Muñiz +2

Task graph scheduling is a relevant problem in computer science with application to diverse real world domains. Task graph scheduling suffers from a combinatorial explosion and thu…