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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of mathematical modelling and algorithms Jg. 8; H. 3; S. 271 - 292
Hauptverfasser:	Jouglet, Antoine, Oğuz, Ceyda, Sevaux, Marc
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.08.2009 Springer Nature B.V Springer Verlag
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!