{'fraction_non_alphanumeric': 0.01276595744680851, 'fraction_numerical': 0.0, 'mean_word_length': 5.299107142857143, '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 new unrelated parallel machine scheduling problem with tool changes to minimise the total energy consumption

The previous studies on scheduling problem with tool changes take processing time as the only reason for the tool wear, which is not accurate in the real manufacturing system. This paper takes processing speed and processing time into consideration simultaneously and proposes a new unrelated parallel machine scheduling problem (UPMSP) with tool changes caused by the tool wear, in which the energy consumption rate of the parallel machines is influenced by two factors: tool changes and corresponding processing speed. A new effective heuristic evolutionary algorithm (NHEA) is presented to solve the proposed UPMSP with objectives of optimising total energy consumption and makespan. For the NHEA, some effective operators such as target-searching operators are designed to accelerate the search efficiency and further exploit the solution space. A first fit decreasing algorithm is presented and incorporated into the NHEA to reduce the number of tool changes. The Taguchi method of Design of Experiments is used to obtain the best combination of key parameters of the NHEA. Extensive computational experiments are carried out to compare the NHEA with some well-known algorithms. The results validate that the proposed NHEA is able to obtain better Pareto solutions for UPMSP with tool changes.