Eingang zum Volltext in OPUS

Hinweis zum Urheberrecht

Aufsatz zugänglich unter
URL: http://opus.uni-lueneburg.de/opus/volltexte/2003/217/

Production Planning with Simulated Annealing

Urban, Karsten-Patrick

Dokument 1.pdf (64 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Lokales Suchverfahren , Produktionsplanung , Reihenfolgeplanung
Freie Schlagwörter (Deutsch): Flow-Shop-Problem , Maschinenbelegungsplanung
Freie Schlagwörter (Englisch): Simulated Annealing , Flow-Shop-Scheduling
Institut: Frühere Fachbereiche
DDC-Sachgruppe: Allgemeines, Wissenschaft
Dokumentart: Aufsatz
Sprache: Englisch
Erstellungsjahr: 2003
Publikationsdatum: 22.12.2003
Kurzfassung auf Englisch: Combinatorial optimization is still one of the biggest mathematical challenges if you plan and organize the run-ning of a business. Especially if you organize potential factors or plan the scheduling and sequencing of opera-tions you will often be confronted with large-scaled combinatorial optimization problems. Furthermore it is very difficult to find global optima within legitimate time limits, because the computational effort of such problems rises exponentially with the problem size. Nowadays several approximation algorithms exist that are able to solve this kind of problems satisfactory. These algorithms belong to a special group of solution methods which are called local search algorithms. This article will introduce the topic of simulated annealing, one of the most efficient local search strategies. This article summarizes main aspects of the guest lecture Combinatorial Optimi-zation with Local Search Strategies, which was held at the University of Ioannina in Greece in June 1999.

Home | Suchen | English
Fragen und Anregungen an ubsrvc@leuphana.de
Letzte Änderung: 10.11.16