{'fraction_non_alphanumeric': 0.012048192771084338, 'fraction_numerical': 0.0, 'mean_word_length': 5.5285714285714285, '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}}
Heuristics for the Operating Theatre Planning and Scheduling

In this paper, we present a two-stage approach for planning and scheduling of operating theatres. The first stage concerns the operating theatre planning problem with the objectiveof minimizing number of days required to assign all surgical cases and number of days wasted for failure to meet surgical cases deadlines. The second stage refers to the operating theatre scheduling problem with the objective of minimizing total tardiness of surgical cases and total waiting time of surgeons in operating rooms. For each problem investigated, a mathematical formulation using a mixed integer programming has been suggested. And to solve the foregoing problems, we propose firstly a set of dispatching rulebased heuristics and secondly three metaheuristics. Finally, computational experiments are presented to compare the performances of these heuristics.