EconPapers    
Economics at your fingertips  
 

A branch and bound algorithm for locating input and output points of departments on the block layout

Kim J-G () and Kim Y-D ()
Additional contact information
Kim J-G: Korea Advanced Institute of Science and Technology
Kim Y-D: Korea Advanced Institute of Science and Technology

Journal of the Operational Research Society, 1999, vol. 50, issue 5, 517-525

Abstract: Abstract We consider the problem of locating input and output (I/O) points of each department for a given layout. The objective of the problem is to minimise the total distance of material flows between the I/O points. Here, distances between the I/O points are computed as the lengths of the shortest path (not the rectilinear distances) between the I/O points. We developed a procedure to eliminate dominated candidate positions of I/O points that do not need to be considered. With this procedure, a large number of dominated candidate positions can be eliminated. A linear programming (LP) model for minimising the total rectilinear distance of flows is used to obtain a lower bound. Using the elimination procedure and the LP model, a branch and bound algorithm is developed to find an optimal location of the I/O points. Results from computational experiments show that the suggested algorithm finds optimal solutions in a very short time even for large-sized problems.

Keywords: facility layout; input and output points; branch and bound algorithm (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600720 Abstract (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600720

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600720

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-19
Handle: RePEc:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600720