A fast hybrid tabu search algorithm for the no-wait job shop problem

This paper describes a hybrid tabu search algorithm dedicated to a job shop problem with a no-wait constraint with a makespan criterion. The proposed here algorithm complexity is that the superior algorithm based on the tabu search technique selects parameters controlling the work of a certain const...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering 2009-05, Vol.56 (4), p.1502-1509
Hauptverfasser:	Bożejko, Wojciech, Makuchowski, Mariusz
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Comparative analysis Complexity theory Hybrid algorithm Job shop problem Job shops No-wait constraint Optimization algorithms Studies Tabu search
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!