TY  - RPRT
A1  - Kallrath, J.
A1  - Müller, M.C.
A1  - Nickel, S.
T1  - Batch Presorting Problems:Models and Complexity Results
N2  - 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.
T3  - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 40 
KW  - Complexity theory
KW  - Integer programming
KW  - Assigment
KW  - Logistics
Y1  - 2002
UR  - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1497
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-13056
ER  -