A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

This paper proposes a novel hybrid discrete differential evolution (HDDE) algorithm for solving blocking flow shop scheduling problems to minimize the maximum completion time (i.e. makespan). Firstly, in the algorithm, the individuals are represented as discrete job permutations, and new mutation an...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2010-03, Vol.37 (3), p.509-520
Hauptverfasser:	Wang, Ling, Pan, Quan-Ke, Suganthan, P.N., Wang, Wen-Hong, Wang, Ya-Min
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Blocking flow shop Differential evolution Discrete differential evolution Efficiency Genetic algorithms Hybrid algorithm Job shops Local search Optimization algorithms Production scheduling Simulation Speed-up Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!