• Treffer 3 von 4
Zurück zur Trefferliste

Production Planning with Simulated Annealing

  • 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.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar
Metadaten
Verfasserangaben:Karsten-Patrick Urban
URN:urn:nbn:de:gbv:luen4-opus4-3051
URL: https://pub-data.leuphana.de/frontdoor/index/index/docId/305
Dokumentart:Research Paper
Sprache:Englisch
Erscheinungsjahr:2003
Datum der Veröffentlichung (online):22.12.2003
Datum der Freischaltung:22.12.2003
Freies Schlagwort / Tag:Flow-Shop-Problem; Maschinenbelegungsplanung
Flow-Shop-Scheduling; Simulated Annealing
GND-Schlagwort:Lokales Suchverfahren; Produktionsplanung; Reihenfolgeplanung
Fakultät / Forschungszentrum:Universität / Frühere Fachbereiche
DDC-Klassifikation:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke