Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search

The paper considers the hybrid flow-shop scheduling problem with multiprocessor tasks. Motivated by the computational complexity of the problem, we propose a memetic algorithm for this problem in the paper. We first describe the implementation details of a genetic algorithm, which is used in the mem...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of mathematical modelling and algorithms Ročník 8; číslo 3; s. 271 - 292
Hlavní autori:	Jouglet, Antoine, Oğuz, Ceyda, Sevaux, Marc
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.08.2009 Springer Nature B.V Springer Verlag
Predmet:	Algorithms Computer Science Data Mining and Knowledge Discovery Genetic algorithms Management Science Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Multiprocessing Mutation Operations Research Optimization Performance evaluation Scheduling Studies Multiprocessor task scheduling Memetic algorithm Hybrid flow-shop Genetic algorithm Constraint programming
ISSN:	1570-1166, 2214-2487, 1572-9214, 2214-2495
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!