ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

Raghavan, NR Srinivasa and Venkataramana, M (2009) Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization. In: The International Journal of Advanced Manufacturing Technology, 41 (9-10). pp. 986-996.

[img] PDF
fulltext.pdf - Published Version
Restricted to Registered users only

Download (228Kb) | Request a copy
Official URL: http://www.springerlink.com/content/x3334806804480...

Abstract

In the modern business environment, meeting due dates and avoiding delay penalties are very important goals that can be accomplished by minimizing total weighted tardiness. We consider a scheduling problem in a system of parallel processors with the objective of minimizing total weighted tardiness. Our aim in the present work is to develop an efficient algorithm for solving the parallel processor problem as compared to the available heuristics in the literature and we propose the ant colony optimization approach for this problem. An extensive experimentation is conducted to evaluate the performance of the ACO approach on different problem sizes with the varied tardiness factors. Our experimentation shows that the proposed ant colony optimization algorithm is giving promising results compared to the best of the available heuristics.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Springer Publisher.
Keywords: Scheduling - Parallel processors - Total weighted tardiness - Metaheuristics - Ant colony optimization
Department/Centre: Division of Information Sciences > Management Studies
Date Deposited: 06 Jan 2010 05:16
Last Modified: 19 Sep 2010 05:37
URI: http://eprints.iisc.ernet.in/id/eprint/21430

Actions (login required)

View Item View Item