Hybrid particle swarm optimization for hybrid flowshop scheduling problem with maintenance activities

12Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm. © 2014 Jun-qing Li et al.

Cite

CITATION STYLE

APA

Li, J. Q., Pan, Q. K., & Mao, K. (2014). Hybrid particle swarm optimization for hybrid flowshop scheduling problem with maintenance activities. Scientific World Journal, 2014. https://doi.org/10.1155/2014/596850

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free