{'fraction_non_alphanumeric': 0.02383053839364519, 'fraction_numerical': 0.0, 'mean_word_length': 5.710059171597633, '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}}
Multi-objective optimization Model for Flexible Job Shop Scheduling Problem Considering Transportation Constraints: A Comparative Study

Flexible job shop scheduling problem (FJSP) has long been a complex problem due to the resource flexibility and strong constraints, generating a mixed-integer non-linear optimization problem. The problem becomes more complex with the increasing demand of energy reduction and the corresponding environmental impacts. Proper production scheduling is of significant potential in saving energy in the manufacturing system. In this paper, a multi-objective FJSP model is formulated with the objectives of minimizing the makespan and energy consumption considering strong transportation constraints. Two popular multi-objective optimization solver including Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and A Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D) are employed and compared in a real-world instance of the FJSP, associated with novel coding schemes. The results show that the proposed model is well solved by the two solvers and NSGA-II get the better solutions.