Shortest-route formulation of mixed-model assembly line balancing problem

被引：88

作者：

Erel, E ^{[1
]}

Gokcen, H

机构：

[1] Bilkent Univ, Fac Business Adm, TR-06533 Bilkent, Turkey

[2] Gazi Univ, Dept Ind Engn, TR-06570 Ankara, Turkey

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 116卷 / 01期

关键词：

assignment; assembly line balancing; network programming;

D O I：

10.1016/S0377-2217(98)00115-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A shortest-route formulation of the mixed-model assembly line balancing problem is presented. Common tasks across models are assumed to exist and these tasks are performed in the same stations. The formulation is based on an algorithm which solves the single-model version of the problem. The mixed-model system is transformed into a single-model system with a combined precedence diagram. The model is capable of considering any constraint that can be expressed as a function of task assignments. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：194 / 204

页数：11