Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations

详细信息    查看全文

• 作者：André ; Rossi^a ; ^{andre.rossi@univ-angers.fr" class="auth_mail" title="E-mail the corresponding author} ; Evgeny Gurevsky^b ; ^{evgeny.gurevsky@univ-nantes.fr" class="auth_mail" title="E-mail the corresponding author} ; Olga Battaï ; a^c ; ^{olga.battaia@isae.fr" class="auth_mail" title="E-mail the corresponding author} ; Alexandre Dolgui^d ; ^{alexandre.dolgui@mines-nantes.fr" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Assembly line design/balancing ; Stability radius ; Sensitivity ; Robustness ; Task time variability ; MILP
• 刊名：Discrete Applied Mathematics
• 出版年：2016
• 出版时间：31 July 2016
• 年：2016
• 卷：208
• 期：Complete
• 页码：123-136
• 全文大小：521 K

文摘

This paper deals with an optimization problem that arises when a new paced simple assembly line has to be designed subject to a limited number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem, referred to as SALPB-S, consists in assigning the set of tasks to workstations so as to find the most robust line configuration (or solution) under task time variability. The robustness of solution is measured via its stability radius, i.e., as the maximal amplitude of deviations for task time nominal values that do not violate the solution feasibility. In this work, the concept of stability radius is considered for two well-known norms: class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0166218X16301251&_mathId=si100.gif&_user=111111111&_pii=S0166218X16301251&_rdoc=1&_issn=0166218X&md5=16257b6e94394be570752b2bd290707b" title="Click to view the MathML source">ℓ₁class="mathContainer hidden">class="mathCode">msub>ℓ1msub> and class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0166218X16301251&_mathId=si101.gif&_user=111111111&_pii=S0166218X16301251&_rdoc=1&_issn=0166218X&md5=725f96aae458fc018824fbef8c29e527" title="Click to view the MathML source">ℓ_∞class="mathContainer hidden">class="mathCode">msub>ℓ∞msub>. For each norm, the problem is proven to be strongly class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0166218X16301251&_mathId=si102.gif&_user=111111111&_pii=S0166218X16301251&_rdoc=1&_issn=0166218X&md5=fedcf8bf7826dd79746a672a9f832bd6" title="Click to view the MathML source">NPclass="mathContainer hidden">class="mathCode">$\mathcal{NP}$-hard and a mixed-integer linear program (MILP) is proposed for addressing it. To accelerate the seeking of optimal solutions, an upper bound on the stability radius is devised and integrated into the corresponding MILP. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Simple Assembly Line Balancing Problem.