Pareto-Based Complete Local Search and Combined Timetabling for Multi-objective Job Shop Scheduling Problem with No-Wait Constraint

摘要

Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.