{'fraction_non_alphanumeric': 0.021396396396396396, 'fraction_numerical': 0.0, 'mean_word_length': 5.35, '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}}
Constructing pareto-optimal residency call schedules

In constructing year-long call schedules for medical residents, a key challenge is the multicriteria nature of the problem -the quality of a schedule depends on a number of (often competing) metrics. One way to address this is to assign weights to each metric to trade off between them in the objective function. This introduces a new challenge, however: requiring the schedulers (here, the Chief Residents) to identify weights that accurately represent their preferences. In this paper, we instead present an efficient way to generate the complete set of Paretooptimal solutions. The scheduler can then select a preferred schedule from this set, rather than trying to implicitly represent their preferences by weights. Computational results from a realworld residency scheduling problem demonstrate the tractability of this approach.