By Topic

Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines

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

1 Author(s)
Mönch, L. ; Dept. of Math. & Comput. Sci., Univ. of Hagen, Hagen

In this paper, we present an efficient method to solve unrelated parallel machine total weighted tardiness (TWT) scheduling problems. We apply an ant colony optimization (ACO) approach as a heuristic to solve this NP-hard problem. A colony of artificial ants is used to construct iteratively solutions of the scheduling problem using artificial pheromone trails and heuristic information. For the computation of the heuristic information, we use the apparent tardiness cost (ATC) dispatching rule. We additionally improve the TWT value by applying a decomposition heuristic that solves a sequence of smaller scheduling problems optimally. We report on computational experiments based on stochastically generated test instances. Problems of this type arise in semiconductor manufacturing and have great practical relevance.

Published in:

Automation Science and Engineering, 2008. CASE 2008. IEEE International Conference on

Date of Conference:

23-26 Aug. 2008