Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Heuristic-Tabu-Genetic Algorithm Based Method for Flowshop Scheduling to Minimize Flowtime

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)
Minmei Huang ; Sch. of Manage., Wuhan Univ. of Technol. ; Ronggui Luo ; Jijun Yuan

In order to avoid premature convergence, a method based on heuristic-tabu-genetic algorithm was developed to solve the NP-complete problem of flowshop scheduling to minimize flowtime of jobs. Constructive heuristic and random methods were used to generate initial solutions, tabu search was carried out before PMX crossover and swapping mutation operations to obtain local optimal solutions for each chromosome in the population, and a population management strategy was designed to generate new population. The results of extensive computational experiments indicate that the heuristic-tabu-genetic algorithm is feasible, efficient and superior to the tabu search and constructive heuristic, and suggests that this proposed algorithm can also provide seed solutions for the problem of flowshop scheduling with flexible resources

Published in:

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on  (Volume:2 )

Date of Conference:

0-0 0