1. Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
- Author
-
Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui, André Rossi, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Centrale de Nantes (FRANCE), Ecole des Mines de Nantes (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Université de Nantes (FRANCE), Université Nantes Angers Le Mans - UNAM (FRANCE), Université d'Angers (FRANCE), Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (Polytech Nantes), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), Mines Nantes (Mines Nantes), and Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN)
- Subjects
0209 industrial biotechnology ,Mathematical optimization ,Optimization problem ,Workstation ,Linear programming ,Computer science ,0211 other engineering and technologies ,02 engineering and technology ,Maximal amplitude ,Upper and lower bounds ,law.invention ,Cycle time ,020901 industrial engineering & automation ,Sensitivity ,law ,Robustness (computer science) ,Discrete Mathematics and Combinatorics ,Robustness ,ComputingMilieux_MISCELLANEOUS ,MILP ,021103 operations research ,Applied Mathematics ,[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] ,Assembly line design/balancing ,Stability radius ,Recherche opérationnelle ,Task time variability - Abstract
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: ? 1 and ? ∞ . For each norm, the problem is proven to be strongly 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.
- Published
- 2016