Approach of Solving Dual Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problem Based on MOEA/D
DOI:
https://doi.org/10.3991/ijoe.v14i07.8966Keywords:
Dual resource constrained, flexible job-shop scheduling, MOEA/DAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.