Evaluating the Performance of Tabu Search Procedures for Flow Shop Sequencing

We address the problem of minimising makespan in a flow shop by using tabu search procedures. By combining different neighbourhood structures, neighbourhood examinations, and stopping conditions we obtain alternative tabu search procedures. Starting from a common initial solution we evaluate the rel...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	The Journal of the Operational Research Society 1998-12, Vol.49 (12), p.1296-1302
Hauptverfasser:	Moccellin, J. V., Nagano, M. S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Experimental procedures Heuristic Heuristic methods Heuristics Job shops Operational research and scientific management Operational research. Management science Operations research Scheduling Scheduling, sequencing Searches Sequencing Sequential scheduling Simulated annealing Studies Taboos Tabu search Technical Notes Vehicles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We address the problem of minimising makespan in a flow shop by using tabu search procedures. By combining different neighbourhood structures, neighbourhood examinations, and stopping conditions we obtain alternative tabu search procedures. Starting from a common initial solution we evaluate the relative performance of such procedures considering both the solution quality and computational effort.
ISSN:	0160-5682 1476-9360 0160-5682
DOI:	10.1038/sj.jors.2600633