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.
Download full text files
Additional Services
| Author: | J. Kallrath, M.C. Müller, S. Nickel |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-13056 |
| Series (Serial Number): | Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (40) |
| Document Type: | Report |
| Language of publication: | English |
| Year of Completion: | 2002 |
| Year of first Publication: | 2002 |
| Publishing Institution: | Fraunhofer-Institut für Techno- und Wirtschaftsmathematik |
| Date of the Publication (Server): | 2004/02/10 |
| Tag: | Assigment; Complexity theory; Integer programming; Logistics |
| Faculties / Organisational entities: | Fraunhofer (ITWM) |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |