System Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Single Machine Total Weighted Tardiness Problem with Genetic Algorithms

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

2 Author(s)
Ferrolho, A. ; Super. Sch. of Technol. of the Polytech. Inst. of Viseu, Viseu ; Crisostomo, M.

Genetic algorithms can provide good solutions for scheduling problems. In this paper we present a genetic algorithm to solve the single machine total weighted tardiness problem, a scheduling problem which is known to be NP-hard. First, we present a new concept of genetic operators for scheduling problems. Then, we present a developed software tool, called HybFlexGA, to examine the performance of various crossover and mutation operators by computing simulations of scheduling problems. Finally, the best genetic operators obtained from our computational tests are applied in the HybFlexGA. The computational results obtained with 40, 50 and 100 jobs show the good performance and the efficiency of the developed HybFlexGA.

Published in:

Computer Systems and Applications, 2007. AICCSA '07. IEEE/ACS International Conference on

Date of Conference:

13-16 May 2007