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 条
  • [21] GENACE: An efficient cultural algorithm for solving the flexible job-shop problem
    Ho, NB
    Tay, JC
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1759 - 1766
  • [22] An Efficient Heuristic Algorithm for Flexible Job-Shop Scheduling Problem with Due Windows
    Ai, Yi
    Wang, Mengying
    Xue, Xiaoguang
    Yan, Chao-Bo
    [J]. 2022 IEEE 18TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2022, : 142 - 147
  • [23] A new heuristic algorithm for solving the job shop scheduling problem
    Yin, Aihua
    Zhang, Shousheng
    [J]. COMPUTATION IN MODERN SCIENCE AND ENGINEERING VOL 2, PTS A AND B, 2007, 2 : 1412 - 1416
  • [24] PBIL ALGORITHM FOR FLEXIBLE JOB-SHOP PROBLEM
    Yu, Li
    Jin, Bingyao
    Ni, Yinghua
    [J]. INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE & TECHNOLOGY, PROCEEDINGS, 2009, : 551 - 554
  • [25] A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems
    Gholami, Omid
    Sotskov, Yuri N.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 70 (1-4): : 531 - 546
  • [26] A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems
    Omid Gholami
    Yuri N. Sotskov
    [J]. The International Journal of Advanced Manufacturing Technology, 2014, 70 : 531 - 546
  • [27] A new neighborhood structure for solving the flexible job-shop scheduling problem
    Huang, Xuewen
    Chen, Shaofen
    Zhou, Tianyu
    Sun, Yuting
    [J]. Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (09): : 2367 - 2378
  • [28] A meta-heuristic based on the Imperialist Competitive Algorithm (ICA) for solving Hybrid Flow Shop (HFS) scheduling problem with unrelated parallel machines
    Garavito-Hernandez, Edwin
    Pena-Tibaduiza, Eliana
    Perez-Figueredo, Luis E.
    Moratto-Chimenty, Eslendis
    [J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2019, 36 (06) : 362 - 370
  • [29] Solving dual flexible job-shop scheduling problem using a Bat Algorithm
    Xu, H.
    Bao, Z. R.
    Zhang, T.
    [J]. ADVANCES IN PRODUCTION ENGINEERING & MANAGEMENT, 2017, 12 (01): : 5 - 16
  • [30] A Heuristic Batch Flow Line Dynamic Scheduling Algorithm for the Job-Shop Problem
    Peng, Wen-feng
    Du, Zhong-jun
    Wen, Yu
    [J]. INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING (ITME 2014), 2014, : 111 - 116