Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Geoffrion, G. Graves (1974)
Multicommodity Distribution System Design by Benders DecompositionManagement Science, 20
D. Camp, M. Carter, A. Vannelli (1992)
A nonlinear optimization approach for solving facility layout problemsEuropean Journal of Operational Research, 57
J. Benders (1962)
Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 4
S. Heragu, A. Kusiak (1991)
Efficient models for the facility layout problemEuropean Journal of Operational Research, 53
R. Meller, Y. Bozer (1992)
Layout algorithms for single and multiple floor facilities
M. Bazaraa, H. Sherali (1980)
Benders' partitioning scheme applied to a new formulation of the quadratic assignment problemNaval Research Logistics Quarterly, 27
M. Hassan, G. Hogg, Donald Smith (1986)
SHAPE: a construction algorithm for area placement evaluationInternational Journal of Production Research, 24
M. Bazaraa (1975)
Computerized Layout Design: A Branch and Bound ApproachIie Transactions, 7
P. Banerjee, B. Montreuil, C. Moodie, R. Kashyap (1992)
A modelling of interactive facilities layout designer reasoning using qualitative patternsInternational Journal of Production Research, 30
Z. Drezner (1980)
DISCON: A New Method for the Layout ProblemOper. Res., 28
L. Kaufman, F. Broeckx (1978)
An algorithm for the quadratic assignment problem using Bender's decompositionEuropean Journal of Operational Research, 2
B. Montreuil (1991)
A Modelling Framework for Integrating Layout Design and flow Network Design
B. Montreuil, H. Ratliff, M. Goetschalckx (1987)
Matching Based Interactive Facility LayoutIie Transactions, 19
A. Geoffrion (1972)
Generalized Benders decompositionJournal of Optimization Theory and Applications, 10
B. Montreuil, U. Venkatadri, H. Ratliff (1993)
GENERATING A LAYOUT FROM A DESIGN SKELETONIie Transactions, 25
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.
Transportation Science – INFORMS
Published: Nov 1, 1996
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.