A combinatorial particle swarm optimisation for solving permutation flowshop problems

Authors:
Bassem Jarboui;Saber Ibrahim;Patrick Siarry;Abdelwaheb Rebai
Affiliations:
FSEGS, route de l'aéroport km 4, Sfax 3018 Tunisie;FSEGS, route de l'aéroport km 4, Sfax 3018 Tunisie;LiSSi, université de Paris 12, 61 avenue du Général de Gaulle, 94010 Créteil, France;ISAAS, route de l'aéroport km 4, B.P.N 101, Sfax 3018 Tunisie
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 7
Cited 18

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation

Annals of Operations Research
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms for flowshop scheduling problems

Computers and Industrial Engineering
A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness

Expert Systems with Applications: An International Journal
A self-guided genetic algorithm for flowshop scheduling problems

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
The circular discrete particle swarm optimization algorithm for flow shop scheduling problem

Expert Systems with Applications: An International Journal
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times

Computers and Operations Research
Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering
Face recognition method based on support vector machine and particle swarm optimization

Expert Systems with Applications: An International Journal
An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization

Expert Systems with Applications: An International Journal
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization

Computers and Industrial Engineering
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops

Information Sciences: an International Journal
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems

Computers and Operations Research
Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems

Computers and Industrial Engineering
An improved particle swarm optimization for permutation flowshop scheduling problem with total flowtime criterion

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
New VNS heuristic for total flowtime flowshop scheduling problem

Expert Systems with Applications: An International Journal
A new ant colony algorithm for makespan minimization in permutation flow shops

Computers and Industrial Engineering
Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

Expert Systems with Applications: An International Journal
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

Applied Soft Computing
Hybrid sliding level Taguchi-based particle swarm optimization for flowshop scheduling problems

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The m-machine permutation flowshop problem PFSP with the objectives of minimizing the makespan and the total flowtime is a common scheduling problem, which is known to be NP-complete in the strong sense, when m=3. This work proposes a new algorithm for solving the permutation FSP, namely combinatorial Particle Swarm Optimization. Furthermore, we incorporate in this heuristic an improvement procedure based on the simulated annealing approach. The proposed algorithm was applied to well-known benchmark problems and compared with several competing metaheuristics.