Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

An Adaptive Repulsive Particle Swarm Optimization for Makespan and Maximum Lateness Minimization in the Permutation 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
$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)
Jingyu Qiu ; Dept. of Comput. Sci., Sun Yat-sen Univ., Guangzhou ; Jian Yin ; Duanning Zhou

This paper proposes an adaptive repulsive particle swarm optimization (ARPSO) for minimizing the makespan and maximum lateness in the permutation flowshop scheduling problem (PFSP). ARPSO develops a heuristic rule called the smallest distance value (SDV) to present the discrete job permutation for the PFSP. And ARPSO uses several novel evolutionary strategies to avoid premature convergence and improve its continuous optimization ability. Those strategies include adaptive repulsion technique and adaptive non-linearly varying acceleration coefficients. The results show that ARPSO outperforms its competitors.

Published in:

Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on

Date of Conference:

23-24 May 2009