KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Tue, 10 Feb 2004 09:51:14 +0100Tue, 10 Feb 2004 09:51:14 +0100Batch Presorting Problems:Models and Complexity Results
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1497
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.J. Kallrath; M.C. MÃ¼ller; S. Nickelreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1497Tue, 10 Feb 2004 09:51:14 +0100