An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

被引:87
|
作者
Gao, Kai Zhou [1 ,2 ]
Suganthan, Ponnuthurai Nagaratnam [1 ]
Pan, Quan Ke [2 ]
Tasgetiren, Mehmet Fatih [3 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[2] Liaocheng Univ, Sch Comp, Liaocheng, Peoples R China
[3] Yasar Univ, Dept Ind Engn, Izmir, Turkey
基金
美国国家科学基金会;
关键词
discrete harmony search; flexible job shop scheduling; fuzzy processing time; fuzzy completion time; remanufacturing; GENETIC ALGORITHM; OPTIMIZATION ALGORITHM; FLOW-SHOP; COLONY;
D O I
10.1080/00207543.2015.1020174
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP with fuzzy processing time. The objective is to minimise maximum fuzzy completion time. A simple and effective heuristic rule is proposed to initialise harmony population. Extensive computational experiments are carried out using five benchmark cases with eight instances from remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases. The proposed DHS algorithm is compared to six metaheuristics. The results and comparisons show the effectiveness and efficiency of DHS for solving FJSP with fuzzy processing time.
引用
收藏
页码:5896 / 5911
页数:16
相关论文
共 50 条
  • [21] Discrete Differential Evolution Algorithm with the Fuzzy Machine Selection for Solving the Flexible Job Shop Scheduling Problem
    Ajchara Phu-ang
    International Journal of Networked and Distributed Computing, 2018, 7 (1) : 11 - 19
  • [22] Discrete Differential Evolution Algorithm with the Fuzzy Machine Selection for Solving the Flexible Job Shop Scheduling Problem
    Phu-ang, Ajchara
    INTERNATIONAL JOURNAL OF NETWORKED AND DISTRIBUTED COMPUTING, 2018, 7 (01) : 11 - 19
  • [23] A Hybrid Harmony Search Algorithm for the Job Shop Scheduling Problems
    Piroozfard, Hamed
    Wong, Kuan Yew
    Asl, Ali Derakhshan
    2015 8TH INTERNATIONAL CONFERENCE ON ADVANCED SOFTWARE ENGINEERING & ITS APPLICATIONS (ASEA), 2015, : 48 - 52
  • [24] Flexible job shop scheduling problem with interval grey processing time
    Xie, Naiming
    Chen, Nanlei
    APPLIED SOFT COMPUTING, 2018, 70 : 513 - 524
  • [25] An Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended Flexible Job Shop Scheduling Problem
    Lunardi, Willian Tessaro
    Voos, Holger
    Cherri, Luiz Henrique
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 204 - 211
  • [26] An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time
    Chen, Nanlei
    Xie, Naiming
    Wang, Yuquan
    APPLIED SOFT COMPUTING, 2022, 131
  • [27] An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time
    Chen, Nanlei
    Xie, Naiming
    Wang, Yuquan
    Applied Soft Computing, 2022, 131
  • [28] Discrete Harmony Search Algorithm for the No Wait Flow Shop Scheduling Problem with Makespan Criterion
    Gao, Kaizhou
    Xie, Shengxian
    Jiang, Hua
    Li, Junqing
    ADVANCED INTELLIGENT COMPUTING, 2011, 6838 : 592 - 599
  • [29] A hybrid evolutionary immune algorithm for fuzzy flexible job shop scheduling problem with variable processing speeds
    Chen, Xiao-long
    Li, Jun-qing
    Du, Yu
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 233
  • [30] Discrepancy search for the flexible job shop scheduling problem
    Ben Hmida, Abir
    Haouari, Mohamed
    Huguet, Marie-Jose
    Lopez, Pierre
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (12) : 2192 - 2201