Hybrid heuristic for total flowtime minimization in no-wait flow shops

被引：0
|
作者：
Zhu, Xia [1 ,2 ]
Li, Xiaoping [1 ,2 ]
Wang, Qian [1 ,2 ]
机构：
[1] Southeast Univ, Sch Engn & Comp Sci, Nanjing, Peoples R China
[2] Southeast Univ, Minist Edu, Key Lab Comp Network & Informat Integrat, Nanjing, Peoples R China
来源：
PROCEEDINGS OF THE 2007 11TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS 1 AND 2 | 2007年
基金：
中国国家自然科学基金;
关键词：
flow-shop; no-wait; heuristic scheduling; total flowtime;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.
引用
收藏
页码：1050 / +
页数：2
相关论文
共 50 条
  • [1] Heuristic for no-wait flow shops with makespan minimization
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (09) : 2519 - 2530
  • [2] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    Li XiaoPing
    Cheng, Wu
    [J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (07): : 896 - 909
  • [3] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    LI XiaoPing1
    2 Key Laboratory of Computer Network and Information Integration (Southeast University)
    3 Department of Automation
    [J]. Science China(Information Sciences), 2008, (07) : 896 - 909
  • [4] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    XiaoPing Li
    Cheng Wu
    [J]. Science in China Series F: Information Sciences, 2008, 51
  • [5] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    Framinan, Jose Manuel
    Nagano, Marcelo Seido
    Moccellin, Joao Vitor
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 46 (9-12): : 1049 - 1057
  • [6] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    José Manuel Framinan
    Marcelo Seido Nagano
    João Vitor Moccellin
    [J]. The International Journal of Advanced Manufacturing Technology, 2010, 46 : 1049 - 1057
  • [7] 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
  • [8] 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
  • [9] Meta-heuristic for no-wait job shops with makespan minimization
    Zhu, Jie
    Li, Xiaoping
    Zhang, Yi
    Wang, Qian
    [J]. PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 874 - +
  • [10] 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 - +
12345