A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem

被引：0
|
作者：
Mousin, Lucien [1 ]
Kessaci, Marie-Eleonore [1 ]
Dhaenens, Clarisse [1 ]
机构：
[1] Univ Lille, CNRS, Cent Lille, UMR 9189,CRIStAL,Ctr Rech Informat Signal & Autom, F-59000 Lille, France
来源：
LEARNING AND INTELLIGENT OPTIMIZATION (LION 11 2017) | 2017年 / 10556卷
关键词：
TABU SEARCH; SHOP PROBLEM; SETUP TIMES; ALGORITHM; CRITERION; MAKESPAN; MACHINE;
D O I：
10.1007/978-3-319-69404-7_14
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Constructive heuristics have a great interest as they manage to find in a very short time, solutions of relatively good quality. Such solutions may be used as initial solutions for metaheuristics for example. In this work, we propose a new efficient constructive heuristic for the No-Wait Flowshop Scheduling Problem. This proposed heuristic is based on observations on the structure of best solutions of small instances as well as on analyzes of efficient constructive heuristics principles of the literature. Experiments have been conducted and results show the efficiency of the proposed heuristic compared to ones from the literature.
引用
收藏
页码：196 / 209
页数：14
相关论文
共 50 条
  • [41] A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups
    Wang, XL
    Cheng, TCE
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (05) : 1326 - 1344
  • [42] No-wait flexible flowshop scheduling with no-idle machines
    Wang, ZB
    Xing, WX
    Bai, FS
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 609 - 614
  • [43] A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage
    刘志新
    谢金星
    李建国
    董杰方
    [J]. Tsinghua Science and Technology, 2003, (01) : 43 - 48
  • [44] New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times
    Cheng, Chen-Yang
    Pourhejazy, Pourya
    Ying, Kuo-Ching
    Liao, Yi-Hsiu
    [J]. APPLIED SOFT COMPUTING, 2021, 111
  • [45] A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem
    Haoran, Li
    Xinyu, Li
    Liang, Gao
    [J]. APPLIED SOFT COMPUTING, 2021, 100
  • [46] A composite heuristic for the no-wait flow shop scheduling
    Gao Kaizhou
    Suganthan, P. N.
    Bao Zhenqiang
    [J]. 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [47] Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA
    Babor, Majharulislam
    Senge, Julia
    Rosell, Cristina M.
    Rodrigo, Dolores
    Hitzmann, Bernd
    [J]. PROCESSES, 2021, 9 (11)
  • [48] 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 - +
  • [49] A Novel Block-shifting Simulated Annealing Algorithm for the No-wait Flowshop Scheduling Problem
    Ding, Jian-Ya
    Song, Shiji
    Zhang, Rui
    Zhou, Siwei
    Wu, Cheng
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 2768 - 2774
  • [50] Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
    Shao, Weishi
    Shao, Zhongshi
    Pi, Dechang
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 136
12345