{'fraction_non_alphanumeric': 0.012917115177610334, 'fraction_numerical': 0.0, 'mean_word_length': 5.078431372549019, '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}}
Single-machine scheduling with maintenance in a manufacturing system

As machine maintenance is required in many industries, it is usually arranged in a planned schedule. In this paper, we consider a scheduling problem with several maintenance periods where each maintenance period is required after a periodic time interval. In our research, if a job is interrupted due to maintenance, the job can be resumed when machine becomes available. The problem can be treated as a single machine scheduling with deterministic model. A heuristic based on the variable range technique can be applied to solve the problem by providing a small set of efficient schedules with respect to the total flow time and the maximum tardiness.A decision maker can easily select a minimal objective from the small set of efficient schedules according to his preference. Computational performance of the heuristic on various sizes problems is provided.