Balancing two-sided assembly lines with sequence-dependent setup times

被引:67
作者
Ozcan, Ugur [1 ]
Toklu, Bilal [2 ]
机构
[1] Selcuk Univ, Dept Ind Engn, TR-42075 Selcuklu, Konya, Turkey
[2] Gazi Univ, Dept Ind Engn, TR-06570 Ankara, Turkey
关键词
assembly line balancing; two-sided assembly lines; sequence-dependent setup times; integer programming; COMSOAL; GENETIC ALGORITHM;
D O I
10.1080/00207540903140750
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Two-sided assembly lines are often designed to produce large-sized products, such as automobiles, trucks and buses. In this type of production line, both left-side and right-side of the line are used in parallel. In all studies on two-sided assembly lines, sequence-dependent setup times have not yet been considered. However, in real life applications, setups may exist between tasks. Performing a task directly before another task may influence the latter task inside the same station, because a setup for performing the latter task may be required. Furthermore, if a task is assigned to a station as the last one, then it may cause a setup for performing the first task assigned to that station since the tasks are performed cyclically. In this paper, the problem of balancing two-sided assembly lines with setups (TALBPS) is considered. A mixed integer program (MIP) is proposed to model and solve the problem. The proposed MIP minimises the number of mated-stations (i.e., the line length) as the primary objective and it minimises the number of stations (i.e., the number of operators) as a secondary objective for a given cycle time. A heuristic approach (2-COMSOAL/S) for especially solving large-size problems based on COMSOAL (computer method of sequencing operations for assembly lines) method is also presented. An illustrative example problem is solved using 2-COMSOAL/S. To assess the effectiveness of MIP and 2-COMSOAL/S, a set of test problems are solved. The computational results show that 2-COMSOAL/S is very effective for the problem.
引用
收藏
页码:5363 / 5383
页数:21
相关论文
共 23 条
[1]   Balancing and scheduling tasks in assembly lines with sequence-dependent setup times [J].
Andres, Carlos ;
Miralles, Cristobal ;
Pastor, Rafael .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :1212-1223
[2]  
Arcus A.L., 1966, INT J PROD RES, V4, P259
[3]   BALANCING 2-SIDED ASSEMBLY LINES - A CASE-STUDY [J].
BARTHOLDI, JJ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (10) :2447-2461
[4]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[5]   Two-sided assembly line balancing using an ant-colony-based heuristic [J].
Baykasoglu, Adil ;
Dereli, Tuerkay .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (5-6) :582-588
[6]   A survey on problems and methods in generalized assembly line balancing [J].
Becker, C ;
Scholl, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 168 (03) :694-715
[7]   Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure [J].
Becker, Christian ;
Scholl, Armin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (02) :359-374
[8]  
CZCAN U, 2009, COMPUT IND ENG, V57, P217
[9]  
CZCAN U, 2009, INT J ADV MANUF TECH, V43, P822
[10]  
CZCAN U, 2009, COMPUTERS OPERATIONS, V36, P1955