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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of mathematical modelling and algorithms Vol. 8; no. 3; pp. 271 - 292
Main Authors:	Jouglet, Antoine, Oğuz, Ceyda, Sevaux, Marc
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.08.2009 Springer Nature B.V Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!