Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan

被引：0
|
作者：
Wang, Chuyang [1 ]
Li, Xiaoping [2 ]
Wang, Qian [2 ]
机构：
[1] Southeast Univ, Sch Engn & Comp Sci, Nanjing 210096, Peoples R China
[2] Southeast Univ, Minist Educ, Key Lab Comp Network & Informat Integrat, Nanjing 210096, Peoples R China
来源：
PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II | 2008年
基金：
中国国家自然科学基金;
关键词：
local search; no-wait flowshop; makespan; dynamic programming;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, NP-hard no-wait flowshop scheduling problems with makespan minimization are considered. An iterative local search method is proposed which performs a randomized walk in the space of local optima until some stop criterion is satisfied A perturbation mechanism and a compound neighborhood operator (or move) are presented. The proposal is compared with the best algorithm so far. Experimental results show the proposed algorithm outperforms the existing one in effectiveness and in efficiency.
引用
收藏
页码：908 / +
页数：2
相关论文
共 50 条
  • [41] Intelligent Valid Inequalities for No-Wait Permutation Flowshop Scheduling Problems
    Yuksel, Damla
    Kandiller, Levent
    Tasgetiren, Mehmet Fatih
    INTELLIGENT AND FUZZY SYSTEMS: DIGITAL ACCELERATION AND THE NEW NORMAL, INFUS 2022, VOL 1, 2022, 504 : 914 - 922
  • [42] An Improved Quantum-Inspired Evolution Algorithm for No-Wait Flow Shop Scheduling Problem to Minimize Makespan
    Zhao, Jin-Xi
    Qian, Bin
    Hu, Rong
    Zhang, Chang-Sheng
    Li, Zi-Hui
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 536 - 547
  • [43] Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
    Filho, Geraldo Ribeiro
    Nagano, Marcelo Seido
    Lorena, Luiz Antonio Nogueira
    MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2007, 4827 : 1099 - +
  • [44] Strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Ben Gurion Univ of the Negev, Beer-Sheva, Israel
    Oper Res Lett, 4 (171-179):
  • [45] A new hybrid ant colony algorithm for scheduling of no-wait flowshop
    Riahi, Vahid
    Kazemi, Morteza
    OPERATIONAL RESEARCH, 2018, 18 (01) : 55 - 74
  • [46] A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Kats, V
    Levner, E
    OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 171 - 179
  • [47] Properties of two-machine no-wait flowshop scheduling problems
    Chen, Ke-Jia
    Wang, Xiao
    Kongzhi yu Juece/Control and Decision, 2013, 28 (10): : 1502 - 1506
  • [48] Iterative search method for total flowtime minimization no-wait flowshop problem
    Xia Zhu
    Xiaoping Li
    International Journal of Machine Learning and Cybernetics, 2015, 6 : 747 - 761
  • [49] A new hybrid ant colony algorithm for scheduling of no-wait flowshop
    Vahid Riahi
    Morteza Kazemi
    Operational Research, 2018, 18 : 55 - 74
  • [50] Iterative search method for total flowtime minimization no-wait flowshop problem
    Zhu, Xia
    Li, Xiaoping
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2015, 6 (05) : 747 - 761
12345