No-wait Job-Shop Scheduling: Komplexität und Local Search

Dateibereich 5453

736,2 KB in 2 Dateien, zuletzt geändert am 05.04.2007

Dateiliste / Details

DateiDateien geändert amGröße
index.html05.04.2007 09:02:3613,2 KB
schusterdiss.pdf04.04.2003 00:00:00723 KB
This thesis deals with the structure of the no-wait job-shop problem as well as the derivation of fast approximation algorithms. These algorithms are based on a decomposition approach into a sequencing and a timetabling problem that was initially introduced by Macchiaroli et al. (1999). In the thesis the problems are derived from a mixed integer formulation of the original problem and proved to be NP-hard in the strong sense. After presenting a fast heuristic approach for the timetabling problem, the focus lies on the sequencing problem for which several local search algorithms are presented. The algorithms are tested on a wide variety of benchmark problems for the classical job-shop problem. Among the algorithms, the tabu search approach outperforms all other algorithms that can be found in the literature in objective value as well as computation time.
PURL / DOI:
Lesezeichen:
Permalink | Teilen/Speichern
Dokumententyp:
Wissenschaftliche Abschlussarbeiten » Dissertation
Fakultät / Institut:
Fakultät für Mathematik
Dewey Dezimal-Klassifikation:
500 Naturwissenschaften und Mathematik » 510 Mathematik
Stichwörter:
np-hard, taboo search, flow shop
Beitragende:
Prof. Dr. Törner, Günter [Betreuer(in), Doktorvater]
Prof. Dr. Leisten, Rainer [Gutachter(in), Rezensent(in)]
Sprache:
Deutsch
Kollektion / Status:
Dissertationen / Dokument veröffentlicht
Datum der Promotion:
04.04.2003
Dokument erstellt am:
04.04.2003
Dateien geändert am:
05.04.2007
Medientyp:
Text