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 条
12345