Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1135555 | Computers & Industrial Engineering | 2008 | 13 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Bassem Jarboui, Saber Ibrahim, Patrick Siarry, Abdelwaheb Rebai,