Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion

被引：2
|
作者：
Kai-zhou Gao
Quan-ke Pan
Jun-qing Li
机构：
[1] Liaocheng University,College of Computer Science
[2] State Key Laboratory of Digital Manufacturing Equipment and Technology in Huazhong University of Science and Technology,undefined
来源：
The International Journal of Advanced Manufacturing Technology | 2011年 / 56卷
关键词：
No-wait flow shop; Harmony search; Total flowtime; Local search;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, a discrete harmony search algorithm (DHS) is developed for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. Firstly, a harmony is represented as a discrete job permutation, and a new heuristic based on the well-known NEH method is proposed to initialize the harmony memory. Secondly, a novel pitch adjustment rule is employed in the improvisation to produce a new harmony. Thirdly, a local search is presented and embedded to enhance the algorithm's local exploitation ability. Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results and comparison show the effectiveness of the presented DHS algorithm in solving the no-wait flow shop scheduling with total flowtime criterion.
引用
收藏
页码：683 / 692
页数：9
相关论文
共 50 条
  • [41] Some local search algorithms for no-wait flow-shop problem with makespan criterion
    Grabowski, J
    Pempera, J
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) : 2197 - 2212
  • [42] A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Liang, Yun-Chia
    2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING, 2007, : 251 - +
  • [43] Total flow time minimization in no-wait job shop using a hybrid discrete group search optimizer
    Deng, Guanlong
    Zhang, Zhiwang
    Jiang, Tianhua
    Zhang, Shuning
    APPLIED SOFT COMPUTING, 2019, 81
  • [44] AN ORTHOGONAL GENETIC ALGORITHM WITH TOTAL FLOWTIME MINIMIZATION FOR THE NO-WAIT FLOW SHOP PROBLEM
    Liao, Xiao-Ping
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1706 - 1711
  • [45] Ant-colony heuristic algorithm for no-wait flow shop problem with makespan criterion
    School of Information Science and Technology, University of Science and Technology of China, Hefei 230026, China
    不详
    不详
    Jisuanji Jicheng Zhizao Xitong, 2007, 9 (1801-1804+1815):
  • [46] DISCRETE HARMONY SEARCH FOR FLOW-SHOP SCHEDULING
    Wu, Jian
    Zhou, Hong
    ICIM2012: PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2012, : 125 - 128
  • [47] Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm
    R. Tavakkoli-Moghaddam
    A. R. Rahimi-Vahed
    A. H. Mirzaei
    The International Journal of Advanced Manufacturing Technology, 2008, 36 : 969 - 981
  • [48] New hybrid improved genetic algorithm for solving no-wait flow shop scheduling problem
    Pei X.
    Li Y.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (03): : 815 - 827
  • [49] Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm
    Tavakkoli-Moghaddam, R.
    Rahimi-Vahed, A. R.
    Mirzaei, A. H.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (9-10): : 969 - 981
  • [50] An optimal block knowledge driven backtracking search algorithm for distributed assembly No-wait flow shop scheduling problem
    Zhao, Fuqing
    Zhao, Jinlong
    Wang, Ling
    Tang, Jianxin
    APPLIED SOFT COMPUTING, 2021, 112
12345