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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:J. Kallrath, M.C. Müller, S. Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13056
Serie (Series 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 Publication:2002
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:Assigment; Complexity theory; Integer programming; Logistics
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $