An Algorithm for Type-I Assembly Line Balancing Problem with Optimal Workload Balance

被引：2
作者：
Kao, H. H. [1 ]
Yeh, D. H. [2 ]
机构：
[1] Yuanpei Univ, Dept Finance, Hsinchu, Taiwan
[2] Natl Chung Cheng Univ, Dept Business Adm, Chiayi, Taiwan
来源：
2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4 | 2009年
关键词：
Facilities layout; assembly line balancing; workload balance; shortest route;
D O I：
10.1109/IEEM.2009.5372906
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We consider the Type-I assembly line balancing problem (ALBP-I), in which the objective is to minimize the number of workstations needed for a given cycle time. In practice, it is also important that the workload among workstations should be well balanced. The purpose of this study is to develop an optimal algorithm, based on the shortest route algorithm proposed by Gutjahr and Nemhauser in [Management Science 11 (2) (1964) 308-315], that not only minimizes the number of workstations needed, but also optimizes the workload balance among workstations.
引用
收藏
页码：822 / 826
页数：5
相关论文
共 10 条
1