A heuristic for total flowtime minimization in flow shop scheduling

被引：0
|
作者：
Gao, X [1 ]
Li, XP [1 ]
Zhang, HF [1 ]
机构：
[1] Harbin Univ Sci & Technol, Dept Comp Sci & Technol, Harbin 150080, Peoples R China
来源：
Proceedings of 2005 International Conference on Machine Learning and Cybernetics, Vols 1-9 | 2005年
关键词：
heuristic; flow shop; scheduling; total flowtime;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, DIH (Double Inserting Heuristic) is proposed for flow shops with total flowtime minimization, in which the initial solution is improved by combing local-insertion with global-insertion. As well, partial inserting selection is introduced to reduce the computation time. DIH is compared with three best existing heuristics, RZ, WY and FL, on 6000 randomly generated instances in both effectiveness and efficiency. Computational results show that DIH is the best in effectiveness and the CPU time of DIH is more than that of WY or RZ but less than that of FL.
引用
收藏
页码：3656 / 3661
页数：6
相关论文
共 50 条
  • [1] An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling
    Dipak Laha
    Uday K. Chakraborty
    [J]. The International Journal of Advanced Manufacturing Technology, 2008, 38 : 1018 - 1025
  • [2] An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (9-10): : 1018 - 1025
  • [3] Composite heuristic algorithm for permutation flowshop scheduling problems with total flowtime minimization
    Zhang, Yi
    Li, Xiaoping
    Zhu, Jie
    Wang, Qian
    [J]. PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 903 - +
  • [4] 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 - +
  • [5] Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
    Ribas, Imma
    Companys, Ramon
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 87 : 30 - 39
  • [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] An Efficient ILS Heuristic for Total Flow Time Minimization in a Flow Shop Sequence Dependent Group Scheduling Problem
    Villadiego, Harlem Mauricio M.
    Arroyo, Jose Elias C.
    Jacob, Vinicius V.
    dos Santos, Andre Gustavo
    Goncalves, Luciana B.
    [J]. 2012 12TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS (HIS), 2012, : 259 - 264
  • [8] A self-learning hyper-heuristic for the distributed assembly blocking flow shop scheduling problem with total flowtime criterion
    Zhao, Fuqing
    Di, Shilu
    Wang, Ling
    Xu, Tianpeng
    Zhu, Ningning
    Jonrinaldi
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2022, 116
  • [9] HEURISTIC ALGORITHM FOR SCHEDULING IN A FLOWSHOP TO MINIMIZE TOTAL FLOWTIME
    RAJENDRAN, C
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 29 (01) : 65 - 73
  • [10] An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling
    Dipak Laha
    Uday Kumar Chakraborty
    [J]. The International Journal of Advanced Manufacturing Technology, 2009, 44 : 559 - 569
12345