An Improved NSGA-II Algorithm for Dual-Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problems
摘要
An improved NSGA-II algorithm for the dual-resource constrained multi-objective flexible job shop scheduling problem (DRCMOFJSP) is proposed, with improved encoding and decoding and an optimized genetic evolution strategy. In addition, the problem of multi-objective optimization is solved by using non-dominated ordering and congestion computation. Experimental results show that the proposed method outperforms the MOEA/D algorithm in scheduling efficiency.