Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines; therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to mini...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Omega (Oxford) 2009-04, Vol.37 (2), p.272-281
Hauptverfasser:	Ronconi, Débora P., Henriques, Luís R.S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Assembly lines Blocking in-process Branch & bound algorithms Exact sciences and technology Flowshop scheduling Flowshop scheduling Blocking in-process Tardiness Heuristic GRASP GRASP Heuristic Job shops Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Queuing theory. Traffic theory Scheduling, sequencing Studies Tardiness
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!