کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1135555 956103 2008 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A combinatorial particle swarm optimisation for solving permutation flowshop problems
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
A combinatorial particle swarm optimisation for solving permutation flowshop problems
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 54, Issue 3, April 2008, Pages 526–538
نویسندگان
, , , ,