Dynamic algorithm for semi-online warehousing entry problem

High efficiency of stock position optimization decision plays an important role in material handling and insuring of delivery times. concerning on the warehousing entry problem in the storage production integration, a mathematical model considering the minimum of goods shuffling numbers is build based on the formulation of semi-online A-shape bin packing problem through analysis. A heuristics strategy named Dynamic Stacking Strategy (DSS), which in view of vacant workload of overhead cranes between the adjacent incoming goods, and together with stacking constraints embedded in bin packing heuristics is designed to solve the suggested model. The numerical experiments show the validity of the DSS strategy.