Iterative search method for total flowtime minimization no-wait flowshop problem

被引:0
|
作者
Xia Zhu
Xiaoping Li
机构
[1] Southeast University,School of Computer Science and Engineering
[2] Southeast University,Key Laboratory of Computer Network and Information Integration
[3] Ministry of Education,undefined
关键词
No-wait flowshops; Total flowtime; Objective increment; Iterative search method;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, the no-wait flowshop problem with total flowtime minimization is considered. In order to fast evaluate a new solution generated in the searching process in an algorithm, the objective increment properties of fundamental operators are analyzed on the basis of the distance of adjacent jobs in a sequence. An iterative search method is proposed for the considered problem. Two initial solutions are constructed by two investigated heuristics, and assigned as the parent solutions. The parent solutions are improved iteratively by a mini-evolutionary algorithm based on perturbation cycle. Each perturbation cycle consists of a perturb operation and an enhancement process following two strategies: (1) segment-based local search, and (2) iterative global search. The proposed method is compared with the best existing algorithms under the classical benchmark instances. Computational result reveals that the proposed method outperforms the others on effectiveness.
引用
收藏
页码:747 / 761
页数:14
相关论文
共 50 条
  • [1] Iterative search method for total flowtime minimization no-wait flowshop problem
    Zhu, Xia
    Li, Xiaoping
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2015, 6 (05) : 747 - 761
  • [2] Hybrid Genetic-VNS algorithm with total flowtime minimization for the no-wait flowshop problem
    Yang, Ning
    Li, Xiao-Ping
    Zhu, Jie
    Wang, Qian
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 935 - +
  • [3] A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times
    Nagano, Marcelo Seido
    Miyata, Hugo Hissashi
    Araujo, Daniella Castro
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2015, 36 : 224 - 230
  • [4] Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
    Chaudhry, Imran A.
    Ahmed, Riaz
    Khan, Abdul Munem
    [J]. 27TH INTERNATIONAL CONFERENCE ON CADCAM, ROBOTICS AND FACTORIES OF THE FUTURE 2014, 2014, 65
  • [5] 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
    [J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING, 2007, : 251 - +
  • [6] AN ORTHOGONAL GENETIC ALGORITHM WITH TOTAL FLOWTIME MINIMIZATION FOR THE NO-WAIT FLOW SHOP PROBLEM
    Liao, Xiao-Ping
    [J]. PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1706 - 1711
  • [7] Hybrid heuristic for total flowtime minimization in no-wait flow shops
    Zhu, Xia
    Li, Xiaoping
    Wang, Qian
    [J]. PROCEEDINGS OF THE 2007 11TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS 1 AND 2, 2007, : 1050 - +
  • [8] Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
    School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
    [J]. J. Southeast Univ. Engl. Ed., 2008, 2 (168-173): : 168 - 173
  • [9] Local search methods for the flowshop scheduling problem with flowtime minimization
    Pan, Quan-Ke
    Ruiz, Ruben
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 222 (01) : 31 - 43
  • [10] An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization
    Xu, Xiao
    Xu, Zhenhao
    Gu, Xingsheng
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (07) : 7970 - 7979