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 条
  • [1] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
  • [2] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
    Engin, Orhan
    Gunaydin, Cengiz
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (04) : 521 - 529
  • [3] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
    Engin O.
    Günaydin C.
    International Journal of Computational Intelligence Systems, 2011, 4 (4) : 521 - 529
  • [4] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
    Lin, BMT
    Cheng, TCE
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624
  • [5] A HYBRID LOCAL SEARCH ALGORITHM FOR NO-WAIT FLOWSHOP SCHEDULING PROBLEM
    Wang, Jing
    Li, Tieke
    Zhang, Wenxue
    ICIM 2008: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2008, : 157 - 163
  • [6] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
  • [7] An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
    Nagano, Marcelo Seido
    de Almeida, Fernando Siqueira
    Miyata, Hugo Hissashi
    ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1431 - 1449
  • [8] Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
    Chaudhry, Imran A.
    Ahmed, Riaz
    Khan, Abdul Munem
    27TH INTERNATIONAL CONFERENCE ON CADCAM, ROBOTICS AND FACTORIES OF THE FUTURE 2014, 2014, 65
  • [9] Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics
    Lin, Shih-Wei
    Ying, Kuo-Ching
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 64 : 115 - 125
  • [10] Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
    Zhu, Jie
    Li, Xiaoping
    Wang, Qian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (02) : 378 - 386
12345