Abstract
In the factory, many kinds of materials are treated. These materials are stocked in many warehouses. It is an important problem that what items should be stocked in a warehouse, because the material-handling in the factory depends on this assignment. This problem is difficult to deal with because of many items and many points of supply ard delivery. In this paper, we try to reduce the problem scale and propose an algorithm based on the branch and bound method to assign various items to many warehouses for realizing their smooth handling. As a result, we were successful in decreasing the material distance by about 30%.
