论文信息 - Some Complexity Results for the Minimum Blocking Items Problem

Some Complexity Results for the Minimum Blocking Items Problem

In this paper, we study the Minimum Blocking Items Problem (MBIP) as a generalization of the Bounded Coloring Problem for Permutation Graphs and we motivate our interest by discussing some practical applications of MBIP to the context of minimizing reshuffle operations in a container yard. Then we present some results on the computational complexity of MBIP.

Tiziano Bacci | Sara Mattia | Paolo Ventura

[1] Stefan Voß,et al. A chain heuristic for the Blocks Relocation Problem , 2014, Comput. Ind. Eng..

[2] Stefan Voß,et al. A mathematical formulation and complexity considerations for the blocks relocation problem , 2012, Eur. J. Oper. Res..

[3] Gianpaolo Oriolo,et al. Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem , 2010, Theor. Comput. Sci..

[4] Belén Melián-Batista,et al. A domain-specific knowledge-based heuristic for the Blocks Relocation Problem , 2014, Adv. Eng. Informatics.

[5] Klaus Jansen,et al. The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..

[6] Sigrid Knust,et al. Loading, unloading and premarshalling of stacks in storage areas: Survey and classification , 2014, Eur. J. Oper. Res..

[7] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[8] Andrew Lim,et al. Iterative Deepening A* Algorithms for the Container Relocation Problem , 2012, IEEE Transactions on Automation Science and Engineering.

[9] Kees Jan Roodbergen,et al. Storage yard operations in container terminals: Literature overview, trends, and research directions , 2014, Eur. J. Oper. Res..