Journal article

Minimizing the Waiting Times of block retrieval operations in stacking facilities

López-Plata I, Expósito-Izquierdo C, Lalla-Ruiz E, Melián-Batista B, Moreno-Vega J ...see all

Computers and Industrial Engineering, vol. 103 (2017) pp. 70-84 Published by Elsevier Ltd

  • 8

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.
Sign in to save reference

Abstract

This paper addresses the Blocks Relocation Problem with Waiting Times. Its objective is to retrieve a set of homogeneous blocks from a two-dimensional storage by minimizing the waiting times during their retrieval. An integer programming model and a heuristic algorithm are developed to solve this optimization problem. The mathematical model is able to solve small-size cases to optimality in reasonable computational times. Unfortunately, it requires large computational times when tackling medium and large-size scenarios. For its part, the heuristic algorithm overcomes the problems associated with the computational burden of the model by bringing forward the availability of blocks to retrieve from the storage. With this goal in mind, several look ahead strategies dedicated to perform the most promising predictive block relocation movements are proposed. The computational results disclose the proposed heuristic algorithm is able to report high-quality solutions through very short computational times, less than one second, in practical cases.

Author-supplied keywords

  • Blocks Relocation Problem with Waiting Times
  • Heuristic
  • Optimization model
  • Stacking crane

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • J. Marcos Moreno-VegaUniversidad de La Laguna

    Follow
  • Israel López-Plata

  • Christopher Expósito-Izquierdo

  • Eduardo Lalla-Ruiz

  • Belén Melián-Batista

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free