DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, JG | ko |
dc.contributor.author | Kim, Yeong-Dae | ko |
dc.date.accessioned | 2008-10-09T13:10:35Z | - |
dc.date.available | 2008-10-09T13:10:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1999-05 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.50, no.5, pp.517 - 525 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7614 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | STOCKTON PRESS | - |
dc.subject | FACILITY LAYOUT | - |
dc.subject | SYSTEMS | - |
dc.subject | DESIGN | - |
dc.title | A branch and bound algorithm for locating input and output points of departments on the block layout | - |
dc.type | Article | - |
dc.identifier.wosid | 000080306000007 | - |
dc.identifier.scopusid | 2-s2.0-0032653781 | - |
dc.type.rims | ART | - |
dc.citation.volume | 50 | - |
dc.citation.issue | 5 | - |
dc.citation.beginningpage | 517 | - |
dc.citation.endingpage | 525 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1057/palgrave.jors.2600720 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.nonIdAuthor | Kim, JG | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | facility layout | - |
dc.subject.keywordAuthor | input and output points | - |
dc.subject.keywordAuthor | branch and bound algorithm | - |
dc.subject.keywordPlus | FACILITY LAYOUT | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | DESIGN | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.