{'fraction_non_alphanumeric': 0.009237875288683603, 'fraction_numerical': 0.0, 'mean_word_length': 5.062937062937063, '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}}
Parallel machines scheduling based on the impact of deteriorating maintenance

Abstract In this paper we study the problem of revising an initial schedule on parallel identical machines after a subset of jobs has finished processing. This is caused by deteriorating and rate-modifying maintenance. During the planning horizon there should be one maintenance activity scheduled on each machine to improve its processing rate. And delaying the starting time of maintenance should increase the time required to perform it. Considering both the total completion times of all jobs and the impact of maintenance in the form of increase in total machine load, we need to determine the job sequence on each machine and the location of maintenance simultaneously. We provide a polynomial time algorithm to the problem and extend the results to the case of unrelated machines.