Approach of Solving Dual Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problem Based on MOEA/D

Li Xixing, Liu Yi


With considering the scheduling objectives such as makespan, machine workload and product cost, a dual resource constrained flexible job shop scheduling problem is described. To solve this problem, a multi-objective evolutionary algorithm based on decomposition (MOEA/D) was proposed to simplify the solving process, and an improved differential evolution algorithm was introduced for evolving operation. A special encoding scheme was designed for the problem characteristics, the initial population was generated by the combination of random generation and strategy selection, and an improved crossover operator was applied to achieve differential evolution operations. At last, actual test instances of flexible job shop scheduling problem were tested to verify the efficiency of the proposed algorithm, and the results show that it is very effective.


Dual resource constrained; flexible job-shop scheduling; MOEA/D

Full Text:


International Journal of Online Engineering (iJOE).ISSN: 1861-2121
Creative Commons License
Web of Science ESCI logo Engineering Information logo INSPEC logo DBLP logo ELSEVIER Scopus logo EBSCO logo Ulrich's logoGoogle Scholar logo Microsoft® Academic Search