Facility Layout to Support Just-in-Time

Mahdi Kamoun and Candace Arai Yano
Additional contact information
Mahdi Kamoun: Department of Industrial Engineering & Operations Research, University of California, Berkeley, California 94720-1777
Candace Arai Yano: Department of Industrial Engineering & Operations Research, University of California, Berkeley, California 94720-1777

Transportation Science, 1996, vol. 30, issue 4, 315-329

Abstract: In this paper, we develop a heuristic algorithm based on Benders' Decomposition to solve a version of the facility layout problem with decentralized shipping/receiving (s/r). Multiple s/r areas are allowed along the perimeter of the facility and each department can be serviced by the closest s/r area. Our work on this problem was motivated by just-in-time systems which require that frequent trips be made with small move quantities. In such circumstances, the use of decentralized s/r areas can significantly decrease material handling costs. We study a version of the problem in which the dimensions and locations of rectangular departments must be determined (subject to constraints), and each department must be simultaneously assigned to the nearest s/r area. The objective is to minimize the total cost of moving materials between pairs of departments, and between the departments and their respective s/r areas. Computational results for problems with up to 30 departments are reported.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.4.315 (application/pdf)

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:inm:ortrsc:v:30:y:1996:i:4:p:315-329

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().