By Topic

A tabu search heuristic with variable neighborhood for flow shop scheduling problem with limited buffer storage

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)
Qu Guo-qiang ; Sch. of Econ. & Manage., Univ. of Sci. & Technol. Beijing, Beijing, China

This paper explored NP-hard flow shop scheduling problem with limited buffer storage. A tabu search heuristic with variable neighborhood was proposed. An initial seed solution was created by NEH heuristic. Then a restart mechanism was proposed to escape from it after been traped into local optimal. The performance of the algorithm is tested on Rec, hel1 and hel2 benchmark problems. The results are compared to the well-known NEH heuristic to indicate the effectiveness of the proposed approach.

Published in:

Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), 2011 2nd International Conference on

Date of Conference:

8-10 Aug. 2011