Sure, let’s look at the current data flow. We can apply a critical path method to identify the longest dependency chain and then use a heuristic like the shortest remaining processing time to reorder the parallel tasks. That should cut idle time by about 15-20 %. I’ll draft a quick simulation script for the new schedule and we can run a few scenarios.