Modified discrete firefly algorithms with mutation operators as local search for makespan minimization of the permutation flowshop scheduling problem

Combinatorial optimizations the discipline in the area of discrete mathematics that deals with decision making in the case of discrete alternatives. A famous combinatorial optimization problem is the Permutation Flowshop Scheduling Problem (PFSP-a decision problem that deals with how to schedule n...

詳細記述

書誌詳細

第一著者:	Pabrua, Lerr Dwaine Badoy
フォーマット:	学位論文
言語:	English
出版事項:	2011
主題:	Firefly algorithms. Algorithms. Mutation. Combinatorial optimization. Optimization. Hyperbolic tangent function (tanh) Insertion mutation. Permutation. Exchange mutation. Permutation flowshop. Scheduling problem.