A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem
| Autor: | Clarisse Dhaenens, Marie-Eléonore Kessaci, Lucien Mousin |
|---|---|
| Přispěvatelé: | Parallel Cooperative Multi-criteria Optimization (DOLPHIN), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Operational Research, Knowledge And Data (ORKAD) |
| Rok vydání: | 2017 |
| Předmět: |
Structure (mathematical logic)
0209 industrial biotechnology Mathematical optimization 021103 operations research Job shop scheduling Heuristic Computer science media_common.quotation_subject 0211 other engineering and technologies [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] 02 engineering and technology Flow shop scheduling 020901 industrial engineering & automation [INFO]Computer Science [cs] Quality (business) Constructive heuristic Metaheuristic media_common |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319694030 LION 11th Learning and Intelligent OptimizatioN Conference 11th Learning and Intelligent OptimizatioN Conference, Jun 2017, Nizhny Novgorod, Russia HAL |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|