Cart (Loading....) | Create Account
Close category search window
 

An adaptive genetic algorithm for solving the single machine scheduling problem with earliness and tardiness penalties

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
$31 $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

3 Author(s)
Ribeiro, F.F. ; DPPG, CEFET/MG, Belo Horizonte, Brazil ; de Souza, S.R. ; Souza, M.J.F.

This paper deals with the single machine scheduling problem with earliness and tardiness penalties, considering distinct time windows and sequence-dependent setup time. Due to the complexity of this problem, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous search. The initial population is generated by applying GRASP to five dispatch rules. For each individual generated, a polynomial time algorithm is used to determine the initial optimal processing date for each job. During the evaluation process, the best individuals produced by each crossover operator, in each generation undergo refinement in order to improve quality of individuals. Computational results show the effectiveness of the proposed algorithm.

Published in:

Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on

Date of Conference:

11-14 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.