Assembly line balancing with station paralleling

被引：43
|
作者：
Ege, Yunus [1 ]
Azizoglu, Meral [1 ]
Ozdemirel, Nur E. [1 ]
机构：
[1] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2009年 / 57卷 / 04期
关键词：
Single model assembly line balancing; Station paralleling; Branch and bound algorithm; WORKSTATIONS; DESIGN;
D O I：
10.1016/j.cie.2009.05.014
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider the NP-hard problem of assembly line balancing with station paralleling. We assume an arbitrary number of parallel workstations can be assigned to each stage. Every task requires a specified tooling/equipment, and this tooling/equipment should be available in all parallel workstations of the stage to which the task is assigned. Our objective is to find an assignment of tasks to stages so as to minimize sum of station opening and tooling/equipment costs. We propose two branch and bound algorithms: one for optimal solutions and one for near optimal solutions. We find that optimal solutions can be found quickly for medium sized problem instances; for larger sized problems we find high quality solutions in reasonable solution times. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1218 / 1225
页数：8
相关论文
共 50 条
12345