By Topic

Scheduling in parallel machine shop: an ant colony optimization 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)
Sankar, S.S. ; Dept. of Mech. Eng., Arulmigu Kalasalingam Coll. of Eng. ; Ponnambalam, S.G. ; Rathinavel, V. ; Visveshvaren, M.S.

This paper introduces a new approach for decentralized distributed scheduling in a parallel machine shop environment based on the ant colonies optimization (ACO) algorithm. Distributed scheduling in parallel machine shop environment is a NP hard problem which is important to be studied from both theoretical and practical, point of view. The algorithm developed in this work extends the use of the traveling salesman problem for scheduling in one single machine, to multiple parallel machines problem. A job index-based local search method is used as a daemon action in the general ACO frame work. The result obtained through the proposed methodology is compared with that of a few priority dispatch rules and heuristics found in the literature. The proposed algorithm is found to be superior both in terms of quality and consistency of the solutions obtained

Published in:

Industrial Technology, 2005. ICIT 2005. IEEE International Conference on

Date of Conference:

14-17 Dec. 2005