TY  - GEN
A1  - Urban, Karsten-Patrick
T1  - Production Planning with Simulated Annealing
N2  - 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.
KW  - Lokales Suchverfahren
KW  - Produktionsplanung
KW  - Reihenfolgeplanung
KW  - Flow-Shop-Problem
KW  - Maschinenbelegungsplanung
KW  - Simulated Annealing
KW  - Flow-Shop-Scheduling
Y1  - 2003
UR  - http://pub-data.leuphana.de/frontdoor/index/index/docId/305
UR  - https://nbn-resolving.org/urn:nbn:de:gbv:luen4-opus4-3051
ER  -