A New Meta-Heuristic Algorithm for Solving the Flexible Dynamic Job-Shop Problem with Parallel Machines

被引:30
|
作者
Sangaiah, Arun Kumar [1 ]
Suraki, Mohsen Yaghoubi [2 ]
Sadeghilalimi, Mehdi [3 ]
Bozorgi, Seyed Mostafa [4 ]
Hosseinabadi, Ali Asghar Rahmani [5 ]
Wang, Jin [6 ]
机构
[1] Vellore Inst Technol, Sch Comp Sci & Engn, Vellore 632014, Tamil Nadu, India
[2] Islamic Azad Univ, Dept IT & Comp Engn, Qazvin Branch, Qazvin 1519534199, Iran
[3] Islamic Azad Univ Qazvin, Dept Hamun, Qazvin 1519534199, Iran
[4] Islamic Azad Univ, Dept Comp Engn, Tehran North Branch, Tehran 1651153311, Iran
[5] Islamic Azad Univ, Young Researchers & Elite Club, Ayatollah Amoli Branch, Amol 4865116915, Iran
[6] Changsha Univ Sci & Technol, Sch Comp & Commun Engn, Changsha 410004, Hunan, Peoples R China
来源
SYMMETRY-BASEL | 2019年 / 11卷 / 02期
基金
中国国家自然科学基金;
关键词
Dynamic job-shop; Parallel Machines; Maximum flow-time of components; Genetic Algorithm; FLOW-SHOP; GENETIC ALGORITHM; OPTIMIZATION; MAINTENANCE; FLEXIBILITY; RULES;
D O I
10.3390/sym11020165
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In a real manufacturing environment, the set of tasks that should be scheduled is changing over the time, which means that scheduling problems are dynamic. Also, in order to adapt the manufacturing systems with fluctuations, such as machine failure and create bottleneck machines, various flexibilities are considered in this system. For the first time, in this research, we consider the operational flexibility and flexibility due to Parallel Machines (PM) with non-uniform speed in Dynamic Job Shop (DJS) and in the field of Flexible Dynamic Job-Shop with Parallel Machines (FDJSPM) model. After modeling the problem, an algorithm based on the principles of Genetic Algorithm (GA) with dynamic two-dimensional chromosomes is proposed. The results of proposed algorithm and comparison with meta-heuristic data in the literature indicate the improvement of solutions by 1.34 percent for different dimensions of the problem.
引用
收藏
页数:17
相关论文
共 50 条