Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Single machine preemptive scheduling by hybridized meta-heuristic approach

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

4 Author(s)
Javadian, N. ; Dept. of Ind. Eng., Univ. of Sci. & Technol., Babol, Iran ; Rezaeian, J. ; Khorshidian, H. ; Rahmani, K.

This paper is investigated the bi-criteria scheduling problem of minimizing the sum of the earliness and tardiness penalties on a single machine while the preemption is allowed. The problem which is known to be NP-hard is compatible with the concepts of just-in-Time (JIT) production. While the complexity of the problem is high, therefore, meta-heuristic algorithms are highly applied for such problems. Imperialist competitive algorithm (ICA) is a novel global search heuristic that uses imperialistic competition as a source of inspiration. Two meta-heuristic algorithms such as ICA and hybrid algorithm of ICA and genetic algorithm are applied. The computational results show that the performance of the hybrid algorithm is much better than ICA in finding the best solutions and in execution speed.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011