Sequencing mixed-model assembly lines to minimise the number of work overload situations

被引:35
作者
Boysen, Nils [1 ]
Kiel, Mirko [2 ]
Scholl, Armin [2 ]
机构
[1] Univ Jena, Chair Operat Management, D-07743 Jena, Germany
[2] Univ Jena, Chair Management Sci, D-07743 Jena, Germany
关键词
assembly; assembly line balancing; assembly lines; assembly planning; assembly systems; automated assembly; U lines; flexible assembly; sequencing; FRAMEWORK; ALGORITHM;
D O I
10.1080/00207543.2010.507607
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The mixed-model sequencing problem is to sequence different product models launched down an assembly line, so that work overload at the stations induced by direct succession of multiple labour-intensive models is avoided. As a concept of clearing overload situations, especially applied by Western automobile producers, a team of cross-trained utility workers stands by to support the regular workforce. Existing research assumes that regular and utility workers assemble side-by-side in an overload situation, so that the processing speed is doubled and the workpiece can be finished inside a station's boundaries. However, in many real-world assembly lines the application of utility workers is organised completely differently. Whenever it is foreseeable that a work overload will occur in a production cycle, a utility worker takes over to exclusively execute work, whereas the regular worker omits the respective cycle and starts processing the successive workpiece as soon as possible. This study investigates this more realistic sequencing problem and presents a binary linear program along with a complexity proof. Different exact and heuristic solution procedures are then introduced and tested. Additional experiments show that the new model is preferable from an economic point of view whenever utility work causes considerable setup activities, for example walking to the respective station.
引用
收藏
页码:4735 / 4760
页数:26
相关论文
共 27 条
[1]   A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem [J].
Agrawal, S. ;
Tiwari, M. K. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (06) :1405-1429
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[3]  
[Anonymous], COMPUTERS IND ENG
[4]  
[Anonymous], 1997, TABU SEARCH
[5]  
[Anonymous], EUROPEAN J OPERATION
[6]   AN ANALYTIC FRAMEWORK FOR SEQUENCING MIXED MODEL ASSEMBLY LINES [J].
BARD, JF ;
DAREL, E ;
SHTUB, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1992, 30 (01) :35-48
[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]  
Bolat A., 1992, Production Planning and Control, V3, P406, DOI 10.1080/09537289208919410
[9]  
Bolat A., 1992, Production Planning and Control, V3, P393, DOI 10.1080/09537289208919409
[10]  
Bolat A, 1997, J OPER RES SOC, V48, P490, DOI 10.1038/sj.jors.2600391