By Topic

Fragmental optimization on the 2-machine bicriteria flowshop 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
$33 $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)
Gaofeng Huang ; Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore ; A. Lim

The 2-machine bicriteria flowshop scheduling problem F2||(ΣCi/Cmax) is studied in this paper, which minimizes the total flow time subject to the makespan of the schedule being minimum. This problem is known to be strongly NP-hard, and several heuristic algorithms have been proposed to solve it. In this paper, we present a new approach, which we named fragmental optimization (FO), that combines the dynamic programming and local search strategies. Extensive experimentation shows that our FO algorithm outperforms existing heuristics and provides solutions that are very close to the optimal.

Published in:

Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on

Date of Conference:

3-5 Nov. 2003