Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. Issue 4 (17th May 2016)

• Record Type: Journal Article
• Authors: Eddaly, Mansour; Jarboui, Bassem; Siarry, Patrick
• Is Part Of: Journal of computational design and engineering. Volume 3:Issue 4(2016)
• Page Start: 295
• Page End: 311
• Publication Date: 2016-05-17
• Subjects: Scheduling -- Blocking flowshop -- Particle swarm optimization -- Iterated local search -- Makespan; Engineering -- Data processing -- Periodicals; Computer-aided design -- Periodicals; Computer-aided design; Engineering -- Data processing; Electronic journals; Electronic journals; Periodicals; 620.0042
• DOI: 10.1016/j.jcde.2016.05.001
• Languages: English
• ISSNs: 2288-4300

Abstract

Abstract: This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem. Graphical abstract: