## Batch Presorting Problems:Models and Complexity Results

• In this paper we consider short term storage systems. We analyze presorting strategies to improve the effiency of these storage systems. The presorting task is called Batch PreSorting Problem (BPSP). The BPSP is a variation of an assigment problem, i.e., it has an assigment problem kernel and some additional constraints. We present different types of these presorting problems, introduce mathematical programming formulations and prove the NP-completeness for one type of the BPSP. Experiments are carried out in order to compare the different model formulations and to investigate the behavior of these models.

### Weitere Dienste

Verfasserangaben: J. Kallrath, M.C. Müller, S. Nickel urn:nbn:de:hbz:386-kluedo-13056 Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (40) Bericht Englisch 2002 2002 Fraunhofer-Institut für Techno- und Wirtschaftsmathematik 10.02.2004 Assigment; Complexity theory; Integer programming; Logistics Fraunhofer (ITWM) 5 Naturwissenschaften und Mathematik / 510 Mathematik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$