Scatter search with path relinking for the flexible job shop scheduling problem

•Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the stat...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2015-08, Vol.245 (1), p.35-45
Hauptverfasser:	González, Miguel A., Vela, Camino R., Varela, Ramiro
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Comparative analysis Flexible job shop Job shops Neighborhood structures Operations research Optimization algorithms Path relinking Production scheduling Scatter search Scheduling Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!