A GRAPH-THEORETIC HEURISTIC FOR MINIMIZING TOTAL TRANSPORT COST IN FACILITIES LAYOUT

被引：18

作者：

FOULDS, LR

GIFFIN, JW

机构：

[1] Univ of Florida, Dep of Industrial, & Systems Engineering,, Gainesville, FL, USA, Univ of Florida, Dep of Industrial & Systems Engineering, Gainesville, FL, USA

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1985年 / 23卷 / 06期

关键词：

COMPUTER AIDED DESIGN - INDUSTRIAL ENGINEERING - OPERATIONS RESEARCH - Applications Applications;

D O I：

10.1080/00207548508904779

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Existing graph-theoretic heuristics for block plan design attempt to maximize the sum of the REL chart scores of adjacent pairs of facilities. A new graph-theoretical heuristic is presented which has the aim of minimizing total transportation cost instead. This has the advantage of giving credit in the objective function to pairs of facilities which are somewhat near but not actually adjacent. Reported computational experience with the method is encouraging.

引用

页码：1247 / 1257

页数：11