Cart (Loading....) | Create Account
Close category search window
 

Hybrid Tabu Search Algorithm for bi-criteria No-idle permutation flow shop scheduling problem

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

5 Author(s)
Wen-Juan Ren ; Coll. of Comput. Sci., Liao Cheng Univ., Liaocheng, China ; Jun-Hua Duan ; Feng-rong Zhang ; Hong-yan Han
more authors

A novel Hybrid Tabu Search Algorithm (HTS) is proposed for solving bi-criteria No-idle permutation Flow Shop Scheduling Problem in this paper. Two objectives, i.e. the maximum completion time (makespan) and the total flow time (TFT), are considered at the same time. The initial solution of the Tabu Search Algorithm is generated by the famous NEH heuristic. A speed-up method is introduced both in NEH and HTS to improve the efficiency of the algorithm. Then the dynamic feature of the tabu list length is applied to improve the robustness of the algorithm. And a local search method is embedded in the HTS to improve the exploitation capability of the algorithm. It is proved by the extensive computational experiments that the HTS algorithm is superior to the existing algorithms both in computing effectiveness and searching ability.

Published in:

Control and Decision Conference (CCDC), 2011 Chinese

Date of Conference:

23-25 May 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.