By Topic

Local Search Heuristic for Multiple Objective Coil Scheduling Problem 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

2 Author(s)
Yang, Y. ; Logistics Inst., Northeastern Univ., Shenyang, China ; Lixin Tang

This paper researches coil scheduling problem on unrelated parallel continuous annealing production lines, in which two objectives are considered, one is to minimize total tardiness, the other is to minimize the total completion time. To solve this problem, local search method based on ideal point methods is proposed. Firstly, the two objectives are taken into account, respectively. With consideration of the first objective, a linear programming formulation is set up, and then the ideal point can be obtained by standard LP solver. The other objective is dealt by heuristic. At last, a local search heuristic is proposed to find solutions closing to ideal points. Computational results indicate that the proposed algorithm can find satisfactory solutions in reasonable time.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:2 )

Date of Conference:

24-26 April 2009