Robust assembly line balancing with heterogeneous workers

被引:50
作者
Moreira, Mayron Cesar O. [1 ]
Cordeau, Jean-Francois [2 ,3 ]
Costa, Alysson M. [4 ]
Laporte, Gilbert [2 ,5 ]
机构
[1] Univ Fed Lavras, Dept Ciencia Computacao, BR-37200000 Lavras, Brazil
[2] HEC Montreal, CIRRELT, Montreal, PQ H3T 2A7, Canada
[3] HEC Montreal, Canada Res Chair Logist & Transportat, Montreal, PQ H3T 2A7, Canada
[4] Univ Melbourne, Sch Math & Stat, Melbourne, Vic 3010, Australia
[5] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ H3T 2A7, Canada
基金
巴西圣保罗研究基金会; 加拿大自然科学与工程研究理事会;
关键词
Assembly line balancing; Heterogeneous workers; Robust optimization; Integer programming; Constructive heuristic; OPTIMIZATION MODELS; DISABLED WORKERS; BOUND ALGORITHM; JOB ROTATION; ASSIGNMENT; HEURISTICS; DESIGN; UNCERTAINTY; CENTERS; EXAMPLE;
D O I
10.1016/j.cie.2015.07.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Assembly lines are manufacturing systems in which a product is assembled progressively in workstations by different workers or machines, each executing a subset of the needed assembly operations (or tasks). We consider the case in which task execution times are worker-dependent and uncertain, being expressed as intervals of possible values. Our goal is to find an assignment of tasks and workers to a minimal number of stations such that the resulting productivity level respects a desired robust measure. We propose two mixed-integer programming formulations for this problem and explain how these formulations can be adapted to handle the special case in which one must integrate a particular set of workers in the assembly line. We also present a fast construction heuristic that yields high quality solutions in just a fraction of the time needed to solve the problem to optimality. Computational results show the benefits of solving the robust optimization problem instead of its deterministic counterpart. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:254 / 263
页数:10
相关论文
共 50 条
[1]  
Alem D., 2011, COMPUTERS OPERATIONS, V39, P139
[2]   Balancing parallel assembly lines with disabled workers [J].
Araujo, Felipe F. B. ;
Costa, Alysson M. ;
Miralles, Cristobal .
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2015, 9 (03) :344-365
[3]   Two extensions for the ALWABP: Parallel stations and collaborative approach [J].
Araujo, Felipe F. B. ;
Costa, Alysson M. ;
Miralles, Cristobal .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 140 (01) :483-495
[4]   A taxonomy of line balancing problems and their solution approaches [J].
Battaia, Olga ;
Dolgui, Alexandre .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 142 (02) :259-277
[5]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[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]   A robust optimization approach to inventory theory [J].
Bertsimas, D ;
Thiele, A .
OPERATIONS RESEARCH, 2006, 54 (01) :150-168
[8]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[9]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[10]   On solving the assembly line worker assignment and balancing problem via beam search [J].
Blum, Christian ;
Miralles, Cristobal .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :328-339