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
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2015年 / 53卷 / 19期
基金：
美国国家科学基金会;
关键词：
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 条
  • [1] Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives
    K. Z. Gao
    P. N. Suganthan
    Q. K. Pan
    T. J. Chua
    T. X. Cai
    C. S. Chong
    Journal of Intelligent Manufacturing, 2016, 27 : 363 - 374
  • [2] Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives
    Gao, K. Z.
    Suganthan, P. N.
    Pan, Q. K.
    Chua, T. J.
    Cai, T. X.
    Chong, C. S.
    JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (02) : 363 - 374
  • [3] A hybrid harmony search algorithm for the flexible job shop scheduling problem
    Yuan, Yuan
    Xu, Hua
    Yang, Jiadong
    APPLIED SOFT COMPUTING, 2013, 13 (07) : 3259 - 3272
  • [4] An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time
    Wang, Shengyao
    Wang, Ling
    Xu, Ye
    Liu, Min
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3778 - 3793
  • [5] Pareto-based discrete harmony search algorithm for flexible job shop scheduling
    Gao, K. Z.
    Suganthan, P. N.
    Chua, T. J.
    2012 12TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2012, : 953 - 956
  • [6] A genetic algorithm for flexible job shop scheduling with fuzzy processing time
    Lei, Deming
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (10) : 2995 - 3013
  • [7] A flower pollination algorithm for flexible job shop scheduling with fuzzy processing time
    Xu, Wenhao
    Ji, Zhicheng
    Wang, Yan
    MODERN PHYSICS LETTERS B, 2018, 32 (34-36):
  • [8] An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion
    Mehdi Gaham
    Brahim Bouzouia
    Nouara Achour
    Applied Intelligence, 2018, 48 : 1423 - 1441
  • [9] An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion
    Gaham, Mehdi
    Bouzouia, Brahim
    Achour, Nouara
    APPLIED INTELLIGENCE, 2018, 48 (06) : 1423 - 1441
  • [10] An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time
    Xu, Ye
    Wang, Ling
    Wang, Sheng-yao
    Liu, Min
    NEUROCOMPUTING, 2015, 148 : 260 - 268
12345