A memetic algorithm approach for batch-model assembly line balancing problem of sub-block in shipbuilding

被引:10
作者
Qu, Shipeng [1 ]
Jiang, Zuhua [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Ind Engn & Logist Management, Shanghai 200240, Peoples R China
关键词
Batch-model assembly line; sub-block assembly; just-in-time; production sequencing; memetic algorithm; DEPENDENT SETUP TIMES; GENETIC ALGORITHM; OPTIMIZATION; STATIONS; TASKS;
D O I
10.1177/0954405413518511
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Although assembly line balancing problem has been an attractive field of research in many industries over the past decades, few researches focused on the problems in shipbuilding. In this contribution, we deal with a more realistic assembly line for sub-block in shipbuilding, through which lots of small different products were produced. Thus, the problem becomes more complex, which can be regarded as a variant of the classical assembly line balancing problem, batch-model assembly line balancing problem with space and sequence constraints. Our goal is to find the optimal division of the total assignment into different production batches based on the balance of the station workloads and higher efficiencies of the workers and equipments. We solve the said problem with a memetic algorithm, which is illustrated in detail. The validity of the proposed algorithms is tested using the real data of the sub-block assembly in shipbuilding, and the experiment results demonstrate that the proposed algorithm outperforms highly the existing standard genetic algorithm in terms of ability to find the optimal solutions.
引用
收藏
页码:1290 / 1304
页数:15
相关论文
共 33 条
[1]   U-shaped assembly line layouts and their impact on labor productivity: An experimental study [J].
Aase, GR ;
Olson, JR ;
Schniederjans, MJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :698-711
[2]   Heuristic methods for cost-oriented assembly line balancing: A survey [J].
Amen, M .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 68 (01) :1-14
[3]   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
[4]   Formulation and heuristic algorithm for flow time minimization in a simple assembly line [J].
Bahalke, U. ;
Dolatkhahi, K. ;
Dehghani, H. ;
Jahani, E. ;
Yazdanparast, V. ;
Hajihosseini, H. .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2012, 226 (B3) :512-526
[5]   Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules [J].
Bautista, Joaquin ;
Cano, Alberto .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) :495-513
[6]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[7]   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
[8]   Production planning of mixed-model assembly lines: overview and extensions [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
PRODUCTION PLANNING & CONTROL, 2009, 20 (05) :455-471
[9]   A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs [J].
Bukchin, Yossi ;
Rabinowitch, Ithai .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (01) :492-508
[10]   Multiobjective memetic algorithms for time and space assembly line balancing [J].
Chica, Manuel ;
Cordon, Oscar ;
Damas, Sergio ;
Bautista, Joaquin .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (02) :254-273