Utilizing Schedule Constraints to Improve Automated Scheduling in NASA's Deep Space Network

NASA’s Deep Space Network (DSN) is a mission critical facility that supports many different space missions,from LEO to deep space exploration. In recent years, as the network has suffered from increasing oversubscription, more restrictions have been added to reduce the amount of manual scheduling labor necessary to come to consensus. In this paper, we describe a new auto-mated scheduling tool which takes advantage of these restrictions to bring the scheduling problem closer to feasibility. In addition, we describe an algorithm to reduce problem inputs given a partially-solved problem,thereby bringing the problem even closer to feasibility