A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems
This paper considers the multiobjective scheduling of flexible manufacturing systems (FMSs). Due to high degrees of route flexibility and resource sharing, deadlocks often exhibit in FMSs. Manufacturing tasks cannot be finished if any deadlock appears. For solving such problem, this work develops a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/5734149 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832552184745558016 |
|---|---|
| author | Xinnian Wang Keyi Xing Chao-Bo Yan Mengchu Zhou |
| author_facet | Xinnian Wang Keyi Xing Chao-Bo Yan Mengchu Zhou |
| author_sort | Xinnian Wang |
| collection | DOAJ |
| description | This paper considers the multiobjective scheduling of flexible manufacturing systems (FMSs). Due to high degrees of route flexibility and resource sharing, deadlocks often exhibit in FMSs. Manufacturing tasks cannot be finished if any deadlock appears. For solving such problem, this work develops a deadlock-free multiobjective evolutionary algorithm based on decomposition (DMOEA/D). It intends to minimize three objective functions, i.e., makespan, mean flow time, and mean tardiness time. The proposed algorithm can decompose a multiobjective scheduling problem into a certain number of scalar subproblems and solves all the subproblems in a single run. A type of a discrete differential evolution (DDE) algorithm is also developed for solving each subproblem. The mutation operator of the proposed DDE is based on the hamming distance of two randomly selected solutions, while the crossover operator is based on Generalization of Order Crossover. Experimental results demonstrate that the proposed DMOEA/D can significantly outperform a Pareto domination-based algorithm DNSGA-II for both 2-objective and 3-objective problems on the studied FMSs. |
| format | Article |
| id | doaj-art-c82f0e9145d044cf8a6a8aa7dae29d76 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-c82f0e9145d044cf8a6a8aa7dae29d762025-02-03T05:59:25ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/57341495734149A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing SystemsXinnian Wang0Keyi Xing1Chao-Bo Yan2Mengchu Zhou3State Key Laboratory for Manufacturing Systems Engineering, and Systems Engineering Institute, Xi’an Jiaotong University, Xi’an, ChinaState Key Laboratory for Manufacturing Systems Engineering, and Systems Engineering Institute, Xi’an Jiaotong University, Xi’an, ChinaState Key Laboratory for Manufacturing Systems Engineering, and Systems Engineering Institute, Xi’an Jiaotong University, Xi’an, ChinaDepartment of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, USAThis paper considers the multiobjective scheduling of flexible manufacturing systems (FMSs). Due to high degrees of route flexibility and resource sharing, deadlocks often exhibit in FMSs. Manufacturing tasks cannot be finished if any deadlock appears. For solving such problem, this work develops a deadlock-free multiobjective evolutionary algorithm based on decomposition (DMOEA/D). It intends to minimize three objective functions, i.e., makespan, mean flow time, and mean tardiness time. The proposed algorithm can decompose a multiobjective scheduling problem into a certain number of scalar subproblems and solves all the subproblems in a single run. A type of a discrete differential evolution (DDE) algorithm is also developed for solving each subproblem. The mutation operator of the proposed DDE is based on the hamming distance of two randomly selected solutions, while the crossover operator is based on Generalization of Order Crossover. Experimental results demonstrate that the proposed DMOEA/D can significantly outperform a Pareto domination-based algorithm DNSGA-II for both 2-objective and 3-objective problems on the studied FMSs.http://dx.doi.org/10.1155/2019/5734149 |
| spellingShingle | Xinnian Wang Keyi Xing Chao-Bo Yan Mengchu Zhou A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems Complexity |
| title | A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems |
| title_full | A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems |
| title_fullStr | A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems |
| title_full_unstemmed | A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems |
| title_short | A Novel MOEA/D for Multiobjective Scheduling of Flexible Manufacturing Systems |
| title_sort | novel moea d for multiobjective scheduling of flexible manufacturing systems |
| url | http://dx.doi.org/10.1155/2019/5734149 |
| work_keys_str_mv | AT xinnianwang anovelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT keyixing anovelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT chaoboyan anovelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT mengchuzhou anovelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT xinnianwang novelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT keyixing novelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT chaoboyan novelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems AT mengchuzhou novelmoeadformultiobjectiveschedulingofflexiblemanufacturingsystems |