An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model

  • Kuo I
  • Horng S
  • Kao T
 et al. 
  • 29

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

In this paper, a new hybrid particle swarm optimization model named HPSO that combines random-key (RK) encoding scheme, individual enhancement (IE) scheme, and particle swarm optimization (PSO) is presented and used to solve the flow-shop scheduling problem (FSSP). The objective of FSSP is to find an appropriate sequence of jobs in order to minimize makespan. Makespan means the maximum completion time of a sequence of jobs running on the same machines in flow-shops. By the RK encoding scheme, we can exploit the global search ability of PSO thoroughly. By the IE scheme, we can enhance the local search ability of particles. The experimental results show that the solution quality of FSSP based on the proposed HPSO is far better than those based on GA [Lian, Z., Gu, X., & Jiao, B. (2008). A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Solitons and Fractals, 35, 851–861.] and NPSO [Lian, Z., Gu, X., & Jiao, B. (2008). A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Solitons and Fractals, 35, 851–861.], respectively.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Authors

  • I-Hong Kuo

  • Shi-Jinn Horng

  • Tzong-Wann Kao

  • Tsung-Lieh Lin

  • Cheng-Ling Lee

  • Takao Terano

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free