By Topic

Variety of meta-heuristics based on genetic algorithms to solve a generalized job-shop problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fatima Ghedjati ; CReSTIC (URCA), Moulin de la Housse BP 1039, 51687 Reims cedex2-France

In this paper we address a generalized job-shop scheduling problem with unrelated parallel machines and precedence constraints between the jobs operations (corresponding to either linear or non linear process routings). The objective is to minimize the completion time. Resolution of several scheduling problems, including parallel machines scheduling is referred as NP-hard. So, the application of approximate methods to solve them is well appropriate. Considering the success of genetic algorithms, we develop a variety of original techniques based on this meta-heuristic to solve the considered problem. These techniques integrate different strategies linked to mutations and crossovers for selecting the individuals for reproduction and generating a new population. The performance of these algorithms is tested by numerical experiments using randomly generated benchmarks. A comparison between the considered meta-heuristics results is presented.

Published in:

Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on

Date of Conference:

10-13 Oct. 2010