By Topic

Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives

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

2 Author(s)
Suresh, R.K. ; Dept. of Producion Eng., Amritn Vishwa Vidyapeetham, Coimbatore ; Mohanasundaram, K.M.

In this paper, a metaheuristic procedure based on simulated annealing (SA) is proposed to find Pareto-optimal or non-dominated solution set for the permutation flow shop scheduling problems (FSPs) with the consideration of regular performance measures of minimizing the makespan and the total flow time of jobs. A new perturbation mechanism called "segment-random insertion (SRI)" scheme is used to generate the neighbourhood of a given sequence. The performance of the proposed algorithm is evaluated by solving benchmark FSP instances provided by (B. Taillard, 1993). The results obtained are evaluated in terms of the number of non-dominated schedules generated by the algorithm and the proximity of the obtained non-dominated front to the Pareto front. The results and simple quality measures suggested in this paper can be used to evaluate the quality of the non-dominated fronts obtained by different algorithms

Published in:

Cybernetics and Intelligent Systems, 2004 IEEE Conference on  (Volume:2 )

Date of Conference:

1-3 Dec. 2004