By Topic

Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance

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

4 Author(s)
Chandrasekaran, S. ; Sri Ramakrishna Mission Vidyalaya Polytech. Coll., Coimbatore ; Ponnambalam, S.G. ; Suresh, R.K. ; Vijayakumar, N.

The present work deals with the development of particle swarm optimization algorithm to solve the multi-objective flowshop scheduling problem. In this paper, minimization of makespan, total flowtime and completion time variance are considered simultaneously. Performance of the proposed methodology has been tested by solving benchmark scheduling problems available in the literature. The proposed methodology is guided to search a set of non-dominated solutions close to the Pareto front. The search capability of the proposed PSO algorithm is enhanced using a local search mechanism. This work is a preliminary step in our research to identify the reference or Pareto solution sets for the benchmark FSPs proposed in the literature, when (Cmax), (tft) and (ctv) are to be simultaneously optimized.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007