On the application of insertion techniques for job shop problems with setup times

Constructive heuristics for shop scheduling problems are often based on priority (or dispatching) rules. However, recent work has demonstrated that insertion algorithms that step by step insert operations or jobs into partial schedules usually clearly outperform priority rules. In this paper, we con...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	R.A.I.R.O. Recherche opérationnelle 1999-04, Vol.33 (2), p.209-245
Hauptverfasser:	Sotskov, Yuri N., Tautenhahn, Thomas, Werner, Frank
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences constructive heuristics Exact sciences and technology Flows in networks. Combinatorial problems Job Shop scheduling Operational research and scientific management Operational research. Management science setup times
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!