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

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
Μορφή: Thesis
Γλώσσα:English
Έκδοση: 2011
Θέματα:
Firefly algorithms.
Algorithms.
Mutation.
Combinatorial optimization.
Optimization.
Hyperbolic tangent function (tanh)
Insertion mutation.
Permutation.
Exchange mutation.
Permutation flowshop.
Scheduling problem.