Methods and systems for scheduling include forming a search tree. Each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score. The search tree is searched for a path having an optimal associated priority score. A schedule is implemented based on the path having the optimal associated priority score.