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, \ldots , 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 (Gurski et al., Math. Methods Oper. Res., [3], ACM Comput. Res. Repos. (CoRR), 2013, [4]). In this paper we consider two linear programming models for the problem and compare the running times of our models for randomly generated sequences using GLPK and CPLEX solvers. We also draw comparisons with a breadth first search solution for the problem (Gurski et al.,Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015, [7]).
The original version of this chapter was revised: Inline figure has been deleted. The erratum to this chapter is available at 10.1007/978-3-319-42902-1_97
This is a preview of subscription content, log in via an institution.
References
de Koster, R.: Performance approximation of pick-to-belt orderpicking systems. Eur. J. Oper. Res. 92, 558–573 (1994)
Gurski, F.: Efficient binary linear programming formulations for boolean functions. Stat. Optim. Inf. Comput. 2(4), 274–279 (2014)
Gurski, F., Rethmann, J., Wanke, E.: On the complexity of the FIFO stack-up problem. Math. Methods Oper. Res. (To appear)
Gurski, F., Rethmann, J., Wanke, E.: Complexity of the FIFO stack-up problem. ACM Comput. Res. Repos. (CoRR) arXiv:abs/1307.1915(2013)
Gurski, F., Rethmann, J., Wanke, E.: Moving bins from conveyor belts onto pallets using FIFO queues. Operations Research Proceedings (OR 2013), pp. 185–191. Springer, New York (2014)
Gurski, F., Rethmann, J., Wanke, E.: Algorithms for controlling palletizers. Operations Research Proceedings (OR 2014). Springer, New York (2015) (To appear)
Gurski, F., Rethmann, J., Wanke, E.: A practical approach for the FIFO stack-up problem. Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol. 360, pp. 141–152. Springer, New York (2015)
Rethmann, J., Wanke, E.: Storage controlled pile-up systems, theoretical foundations. Eur. J. Oper. Res. 103(3), 515–530 (1997)
Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Discret. Appl. Math. 156(10), 1822–1837 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Gurski, F., Rethmann, J., Wanke, E. (2017). An Experimental Study of Algorithms for Controlling Palletizers. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-42902-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42901-4
Online ISBN: 978-3-319-42902-1
eBook Packages: Business and ManagementBusiness and Management (R0)