{'fraction_non_alphanumeric': 0.01878612716763006, 'fraction_numerical': 0.0, 'mean_word_length': 5.132743362831858, '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}}
A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size.

We present a practical approach to personnel scheduling problems arising in hospital units with demand that is of an urgent nature, cannot be backlogged, and is highly dependent on the time of day. A simple rounding heuristic is combined with a simulated annealing algorithm to obtain near-optimal solutions to large linear integer programming models of these personnel scheduling problems in a reasonable amount of time on a personal computer. The models are designed to complement the current state-of-the-art of commercially available hospital staff scheduling systems.