STUDY ON FACILITIES LOCATION WITH TIE SET.

Shigeyuki Nakai, Kazuho Yoshimoto

Research output: Contribution to journalArticle

Abstract

Deals with the problem of facilities location, sometimes called plant layout. Some facilities location algorithms are developed based upon such graphic theory as spanning tree, planar graph and dual graph. In this paper, nodes are defined as facilities and arrows are defined as materials flow, the information of intraplant movement of materials being described by use of oriented graph. An algorithm, which finds out ″the minimum backward materials flow location″ is developed to rationalize the intraplant facilities location, on the assumption that the facilities locate in a straight line. the feature of this algorithm is in the ability to select the optimal solution, only by using easy matrices manipulation. For verification of it, a trial of this algorithm in regard to 6 actual facilities data is made.

Original languageEnglish
Pages (from-to)1396-1401
Number of pages6
JournalBulletin of the JSME
Volume23
Issue number182
Publication statusPublished - 1980 Aug
Externally publishedYes

Fingerprint

Plant layout

ASJC Scopus subject areas

  • Engineering(all)

Cite this

STUDY ON FACILITIES LOCATION WITH TIE SET. / Nakai, Shigeyuki; Yoshimoto, Kazuho.

In: Bulletin of the JSME, Vol. 23, No. 182, 08.1980, p. 1396-1401.

Research output: Contribution to journalArticle

Nakai, S & Yoshimoto, K 1980, 'STUDY ON FACILITIES LOCATION WITH TIE SET.', Bulletin of the JSME, vol. 23, no. 182, pp. 1396-1401.
Nakai, Shigeyuki ; Yoshimoto, Kazuho. / STUDY ON FACILITIES LOCATION WITH TIE SET. In: Bulletin of the JSME. 1980 ; Vol. 23, No. 182. pp. 1396-1401.
@article{9f41f682be1443839f9743ce41078e67,
title = "STUDY ON FACILITIES LOCATION WITH TIE SET.",
abstract = "Deals with the problem of facilities location, sometimes called plant layout. Some facilities location algorithms are developed based upon such graphic theory as spanning tree, planar graph and dual graph. In this paper, nodes are defined as facilities and arrows are defined as materials flow, the information of intraplant movement of materials being described by use of oriented graph. An algorithm, which finds out ″the minimum backward materials flow location″ is developed to rationalize the intraplant facilities location, on the assumption that the facilities locate in a straight line. the feature of this algorithm is in the ability to select the optimal solution, only by using easy matrices manipulation. For verification of it, a trial of this algorithm in regard to 6 actual facilities data is made.",
author = "Shigeyuki Nakai and Kazuho Yoshimoto",
year = "1980",
month = "8",
language = "English",
volume = "23",
pages = "1396--1401",
journal = "Bulletin of the JSME",
issn = "0021-3764",
publisher = "Society of Mechanical Engineers",
number = "182",

}

TY - JOUR

T1 - STUDY ON FACILITIES LOCATION WITH TIE SET.

AU - Nakai, Shigeyuki

AU - Yoshimoto, Kazuho

PY - 1980/8

Y1 - 1980/8

N2 - Deals with the problem of facilities location, sometimes called plant layout. Some facilities location algorithms are developed based upon such graphic theory as spanning tree, planar graph and dual graph. In this paper, nodes are defined as facilities and arrows are defined as materials flow, the information of intraplant movement of materials being described by use of oriented graph. An algorithm, which finds out ″the minimum backward materials flow location″ is developed to rationalize the intraplant facilities location, on the assumption that the facilities locate in a straight line. the feature of this algorithm is in the ability to select the optimal solution, only by using easy matrices manipulation. For verification of it, a trial of this algorithm in regard to 6 actual facilities data is made.

AB - Deals with the problem of facilities location, sometimes called plant layout. Some facilities location algorithms are developed based upon such graphic theory as spanning tree, planar graph and dual graph. In this paper, nodes are defined as facilities and arrows are defined as materials flow, the information of intraplant movement of materials being described by use of oriented graph. An algorithm, which finds out ″the minimum backward materials flow location″ is developed to rationalize the intraplant facilities location, on the assumption that the facilities locate in a straight line. the feature of this algorithm is in the ability to select the optimal solution, only by using easy matrices manipulation. For verification of it, a trial of this algorithm in regard to 6 actual facilities data is made.

UR - http://www.scopus.com/inward/record.url?scp=0019050914&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019050914&partnerID=8YFLogxK

M3 - Article

VL - 23

SP - 1396

EP - 1401

JO - Bulletin of the JSME

JF - Bulletin of the JSME

SN - 0021-3764

IS - 182

ER -