Optimal lane depths for single and multiple products in block stacking storage systems - optimal multiple lane depths

9 important questions on Optimal lane depths for single and multiple products in block stacking storage systems - optimal multiple lane depths

How to calculate the total area occupied over time by lane n if a total of Q pallets are to be stored. (Sn(Xn,rn))

Sn(xn,rn)= [W(xnL+A/2)]*[(I+Q-Rn*z)/d]

What pattern do optimal lane depths follow if they are allowed to be continuous variables?

Triangular patterns. Depth of lanes will grow with a constant slope. Pallets that remain a long time in the warehouse will receive deeper lanes

How to calculate the number of pallets in lane i?

Xi = (iA/2L) with A be the with of the chosen aisle and L the length of the chosen stack. (What is i)?
  • Higher grades + faster learning
  • Never study anything twice
  • 100% sure, 100% understanding
Discover Study Smart

When there is initial inventory available, where does they store new arriving batches?

In deeper lanes

What does the variable lane depth specify?

The number of palletes that can be stacked in a specific lane

In the backwards recursion function, what are the stages?

That are the lanes

What to minimize in the backward recursion function?

F(i,j), which stands for the minimum amount of area required over time for storing optimally i stacks of an incoming batch into lanes j through N

What complication do you have with the intial F(i,j) formula?

That you don't know what Xn to minimize

What is the non-decreaseing lane depth property?

The elements of an optimal lane depth vector x have non-decreasing values.

The question on the page originate from the summary of the following study material:

  • A unique study and practice tool
  • Never study anything twice again
  • Get the grades you hope for
  • 100% sure, 100% understanding
Remember faster, study better. Scientifically proven.
Trustpilot Logo