AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM

A. W. Neebe and M. R. Rao

Naval Research Logistics Quarterly, 1976, vol. 23, issue 3, 407-420

Abstract: The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set‐packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800230304

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:23:y:1976:i:3:p:407-420

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().