On the hardness of palletizing bins using FIFO queues

DOI10.1016/j.tcs.2019.06.006zbMath1431.68042MaRDI QIDQ2330097

Frank Gurski, Jochen Rethmann, Carolin Rehs

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.006

zbMATH Keywords

computational complexity; combinatorial optimization; pathwidth; palletizing systems; stack-up systems

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B05: Inventory, storage, reservoirs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)