By Topic

An iterated local search for unrelated parallel machines problem with unequal ready times

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
$33 $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)
Chun-Lung Chen ; Department of Accounting Information, Takming University of Science and Technology, Taipei City, Taiwan, R.O.C.

The problem considered in this paper is a set of independent jobs on unrelated parallel machines with sequence-dependent setup times and unequal ready times so as to minimize total weighted number of tardy jobs. An iterated local search (ILS) is developed to solve the problem. It employs a swap shaking procedure and a tabu search algorithm with hybrid neighborhoods to ensure high ILS effectiveness and efficiency. To evaluate the performance of the suggested heuristic, some heuristic rules, a conventional tabu search algorithm, and optimal solutions are examined for comparison purposes. The computational experimental results show that the proposed ILS is a promising method for solving this problem.

Published in:

2008 IEEE International Conference on Automation and Logistics

Date of Conference:

1-3 Sept. 2008