Mixed Model Assembly Line Balancing Problem under Uncertainty

被引:9
作者
Al-e-hashem, S. M. J. Mirzapour [1 ]
Aryanezhad, M. B. [1 ]
Malekly, H. [2 ]
Sadjadi, S. J. [1 ]
机构
[1] Univ Sci & Technol, Dept Ind Engn, Tehran, Iran
[2] Islamic Azad Univ, Grad Sch, Dept Ind Engn, South Tehran Branch, Tehran, Iran
来源
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词
mixed model; assembly line balancing; robust optimization; mixed integer programming optimization; ROBUST SOLUTIONS; OPTIMIZATION;
D O I
10.1109/ICCIE.2009.5223925
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A common assumption in the literature on mixed model assembly line balancing problem is that the task duration is known and deterministic but may differ among various models. In this paper, we present a robust optimization formulation for dealing with task duration uncertainty in a mixed model assembly line balancing problem (RMALB-P) in which task duration can vary in a specific range. RMALB-P is aim to minimize the sum of costs of the stations and the task duplication. Task duplication means that a task which is common to multiple tasks can be assigned to different stations for different models. Finally, RMALB-P is solved optimally and implemented in mixed model assembly lines of IRAN KHODRO Company. The results are compared with the previous existing balance to show the effects of the data uncertainties on the performance of assembly line outputs. The results indicate that the robust balancing approach can be a relatively more reliable method for balancing the mixed model assembly lines.
引用
收藏
页码:233 / +
页数:2
相关论文
共 28 条
[1]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[2]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[3]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[4]   Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems [J].
Ben-Tal, A ;
Boyd, S ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) :63-89
[5]   Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[6]   Tractable approximations to robust conic optimization problems [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) :5-36
[7]   Robust linear optimization under general norms [J].
Bertsimas, D ;
Pachamanova, D ;
Sim, M .
OPERATIONS RESEARCH LETTERS, 2004, 32 (06) :510-516
[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]   Assembly line balancing: Which model to use when? [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) :509-528