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.