The block layout shortest loop design problem

被引：36

作者：

Asef-Vaziri, A

Laporte, G

Sriskandarajah, C

机构：

[1] GERAD, Montreal, PQ H3T 2A7, Canada

[2] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

[3] Univ So Calif, Dept Ind & Syst Engn, Los Angeles, CA 90089 USA

[4] Univ Texas, Dept Management, Richardson, TX 75083 USA

来源：

IIE TRANSACTIONS | 2000年 / 32卷 / 08期

关键词：

D O I：

10.1023/A:1007608811489

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. The problem is formulated as an Integer Linear Program (ILP) initially containing a very large number of constraints. Several simplifications are proposed in order to reduce the problem to a size amenable by standard ILP solvers. Computational results confirm the efficiency and practicality of the proposed approach.

引用

页码：727 / 734

页数：8

共 22 条

[1]

AFENTAKIS P, 1989, INT J FLEX MANUF SYS, V1, P175, DOI DOI 10.1007/BF00223021

[2]

APPLE JM, 1977, PLAN LAYOUT MAT HAND

[3] FACILITIES LAYOUT DESIGN OPTIMIZATION WITH SINGLE-LOOP MATERIAL FLOW PATH CONFIGURATION [J].