{'fraction_non_alphanumeric': 0.018050541516245487, 'fraction_numerical': 0.0, 'mean_word_length': 5.656, '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}}
Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming

Genetic programming (GP) has been rarely applied to scheduling problems. In this paper the use of GP to learn single-machine predictive scheduling (PS) heuristics with stochastic breakdowns is investigated, where both tardiness and stability objectives in face of machine failures are considered. The proposed bi-tree structured representation scheme makes it possible to search sequencing and idle time inserting programs integratedly. Empirical results in different uncertain environments show that GP can evolve high quality PS heuristics effectively. The roles of inserted idle time are then analysed with respect to various weighting objectives. Finally some guides are supplied for PS design based on GP-evolved heuristics.