By Topic

A New Beam Search Algorithm for the Large-Scale Permutation FSP

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

3 Author(s)
Feng Jin ; Dept. of Autom., Tsinghua Univ., Beijing ; Shi-Ji Song ; Cheng Wu

Beam search algorithm, as an adaptation of branch and bound method, is regarded as one of the effective approaches in solving combinational optimization problems. In this paper, a new beam search algorithm for the large-scale permutation flow shop problem is proposed. A new branching scheme is addressed and compared with the traditional branching scheme. With the new branching scheme, the number of partial schedules in search tree can be greatly reduced. To balance the computational effort and solution quality, partial schedules are evaluated with a new approximate function based on forecast. Numerical experiments show that good solutions of large-scale FSPs could be found in a short time with the proposed algorithm

Published in:

Machine Learning and Cybernetics, 2006 International Conference on

Date of Conference:

13-16 Aug. 2006