{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.004433497536945813, 'mean_word_length': 5.386792452830188, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Meta-Heuristic Approach for the Development of Alternative Process Plans in a Reconfigurable Production Environment

The need for automated production plans has evolved over the years due to internal and external drivers like developed products, new enhanced processes and machinery. Reconfigurable manufacturing systems focus on such needs at both production and process planning level. The age of Industry 4.0 focused on mass customization requires computer aided planning techniques that are able to cope with custom changes in products and explores intelligent algorithms for efficient scheduling solutions to reduce lead time. This problem has been categorized as NP-Hard in literature and is addressed by providing intelligent heuristics that focus on reducing machining time of the products at hand. However, as 70% of the lead time is consumed in non-value added tasks, it is fundamental to provide modular solutions that can reduce this time and handle part variety. To address the subject, this paper focuses on the generation of automated process plans for a single machine problem while focusing on reducing time lead time. Two evolutionary algorithms (EAs) have been proposed and compared to answer complex problem of process planning. A modified genetic algorithm (GA) has been proposed in addition to cuckoo search (CS) heuristic for this discrete problem. On testing with selected benchmark part ANC101, significant improvement was seen in terms of convergence with proposed EAs. Moreover, a novel Precedence Group Algorithm (PGA) is proposed to generate quality input for heuristics. The algorithm produces a set of initial population which significantly effects the performance of proposed heuristics. For the discrete constrained process planning problem, GA outperforms CS providing 10% more feasible scheduling options and three times lesser run time as compared to CS. The proposed technique is flexible and responsive in order to accommodate part variety, a necessary requirement for reconfigurable systems.