The blocks relocation problem with item families minimizing the number of reshuffles

DOI10.1007/s00291-022-00703-xzbMath1519.90023OpenAlexW4313856705MaRDI QIDQ6176183

Sven Boge, Sigrid Knust

Publication date: 25 July 2023

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-022-00703-x

zbMATH Keywords

logisticsstacking problemsreshufflesrelocationsstorage unloading

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• A mathematical formulation and complexity considerations for the blocks relocation problem
• Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
• Simulated annealing: A tool for operational research
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Scheduling trams in the morning
• Real-time dispatch of trams in storage yards
• A tree search procedure for the container relocation problem
• The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage
• Advanced methods for container stacking
• An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling
• Performance evaluation of a flexible machining/assembly system and routing comparisons

This page was built for publication: The blocks relocation problem with item families minimizing the number of reshuffles