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

Scheduling parallel batch processors with incompatible job families using ant colony optimization

Raghavan, Srinivasa NR and Venkataramana, M (2006) Scheduling parallel batch processors with incompatible job families using ant colony optimization. In: IEEE International Conference on Automation Science and Engineering,, Oct 08-10, 2006, Shanghai, pp. 507-512.

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

Download (205Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Abstract

The present work concerns with the static scheduling of jobs to parallel identical batch processors with incompatible job families for minimizing the total weighted tardiness. This scheduling problem is applicable in burn-in operations and wafer fabrication in semiconductor manufacturing. We decompose the problem into two stages: batch formation and batch scheduling, as in the literature. The Ant Colony Optimization (ACO) based algorithm called ATC-BACO algorithm is developed in which ACO is used to solve the batch scheduling problems. Our computational experimentation shows that the proposed ATC-BACO algorithm performs better than the available best traditional dispatching rule called ATC-BATC rule.

Item Type: Conference Paper
Additional Information: Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Information Sciences > Management Studies
Date Deposited: 02 Sep 2010 06:29
Last Modified: 19 Sep 2010 06:12
URI: http://eprints.iisc.ernet.in/id/eprint/30528

Actions (login required)

View Item View Item