A memetic algorithm based on a NSGAII scheme fortheflexible job-shop scheduling problem

The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on tw...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 181; no. 1; pp. 745 - 765
Main Authors Frutos, Mariano, Olivera, Ana Carolina, Tohme, Fernando
Format Journal Article
LanguageEnglish
Published 01.12.2010
Subjects
Algorithms
Chromosomes
Genetics
Operations research
Running
Scheduling
Simulated annealing
Statistics
Online AccessGet full text

Cover

More Information
Summary:The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-1
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-010-0751-9