Abstract

This paper considers how to allocate storage space for import containers. In the segregation strategy, stacking newly arrived containers on the top of containers that arrived earlier is not allowed. We analyze cases where the arrival rate of import containers is constant, cyclic, and dynamic. Spaces are allocated for each arriving vessel so as to minimize the expected total number of rehandles. Mathematical models and solution procedures are suggested for obtaining the optimal solution. Numerical examples are provided in order to illustrate the solution procedure.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call