{'fraction_non_alphanumeric': 0.01818181818181818, 'fraction_numerical': 0.0, 'mean_word_length': 5.525925925925926, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Fixed Interval Satellite Range Scheduling

The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic techniques. 
 
Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best of our knowledge, no algorithm has been provided yet for solving multiple-location, prioritized scheduling problems optimally. 
 
We present an optimal polynomial time algorithm for a fixed number of ground stations (or satellites), based on a modified algorithm from the general scheduling literature. We conclude the paper by simulating the cases that demonstrate that the new optimal algorithm outperforms the reference greedy and genetic algorithms.