Abstract
We consider the FIFO Stack-Up problem which arises in delivery industry, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences q 1, …, q k of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of p stack-up places. Each of these pallets has to contain bins of only one label, bins of different labels have to be placed on different pallets. After all bins of one label have been removed from the given sequences, the corresponding stack-up place becomes available for a pallet of bins of another label. The FIFO Stack-Up problem is computational intractable [3]. In this paper we introduce a graph model for this problem, which allows us to show a breadth first search solution. Our experimental study of running times shows that our approach can be used to solve a lot of practical instances very efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Borodin, A.: On-line Computation and Competitive Analysis. Cambridge University Press (1998)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
Gurski, F., Rethmann, J., Wanke, E.: Complexity of the fifo stack-up problem. ACM Computing Research Repository (CoRR) abs/1307.1915 (2013)
Gurski, F., Rethmann, J., Wanke, E.: Moving bins from conveyor belts onto pallets using fifo queues. In: Proceedings of the International Conference on Operations Research (OR 2013), Selected Papers, pp. 185–191. Springer (2014)
Gurski, F., Rethmann, J., Wanke, E.: Algorithms for controlling palletizers. In: Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers. Springer (to appear, 2015)
de Koster, R.: Performance approximation of pick-to-belt orderpicking systems. European Journal of Operational Research 92, 558–573 (1994)
Rethmann, J., Wanke, E.: Storage controlled pile-up systems, theoretical foundations. European Journal of Operational Research 103(3), 515–530 (1997)
Rethmann, J., Wanke, E.: On approximation algorithms for the stack-up problem. Mathematical Methods of Operations Research 51, 203–233 (2000)
Rethmann, J., Wanke, E.: Stack-up algorithms for palletizing at delivery industry. European Journal of Operational Research 128(1), 74–97 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gurski, F., Rethmann, J., Wanke, E. (2015). A Practical Approach for the FIFO Stack-Up Problem. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)