A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20108909
Volume: 181
Issue: 1
Start Page Number: 745
End Page Number: 765
Publication Date: Dec 2010
Journal: Annals of Operations Research
Authors: , ,
Keywords: flexibility, job shop
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.