On the Complexity of Storage Assignment Problems

@inproceedings{AbdelHamid2011OnTC,
  title={On the Complexity of Storage Assignment Problems},
  author={Ayman A. Abdel-Hamid and Ralf Bornd{\"o}rfer},
  year={2011}
}
The storage assignment problem asks for the cost minimal assignment of containers with different sizes to storage locations with different capacities. Such problems arise, for instance, in the optimal control of automatic storage devices in flexible manufacturing systems. This problem is known to be NP-hard in the strong sense. We show that the storage assignment problem is NP -hard for bounded sizes and capacities, even if the sizes have values 1 and 2 and the capacities value 2 only, a case… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Combinatorial optimization problems arising in the design and management of an automatic storage system

  • A. Abdel-Aziz Abdel-Hamid
  • PhD dissertation, Technical University of Berlin
  • 1994
3 Excerpts

Storage assignment in flexible manufacturing: Polyhedral investigations and a cutting plane algorithm

  • A. Abdel-Aziz Abdel-Hamid, M. Grötschel
  • Tech. Rep. SC–94–13, Konrad-Zuse-Zentrum für…
  • 1994
3 Excerpts

Similar Papers

Loading similar papers…