Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Facility Layout to Support Just-in-Time

Facility Layout to Support Just-in-Time 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Transportation Science INFORMS

Facility Layout to Support Just-in-Time

Transportation Science , Volume 30 (4): 15 – Nov 1, 1996
15 pages

Loading next page...
 
/lp/informs/facility-layout-to-support-just-in-time-TnheQBW664

References (15)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0041-1655
eISSN
1526-5447
DOI
10.1287/trsc.30.4.315
Publisher site
See Article on Publisher Site

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.

Journal

Transportation ScienceINFORMS

Published: Nov 1, 1996

There are no references for this article.