Abstract (EN)

This paper deals with an optimization problem, which arises when a new transfer line has to be designed subject to a limited number of available machines, cycle time constraint, and precedence relations between necessary production tasks. The studied problem consists in assigning a given set of tasks to blocks and then blocks to machines so as to find the most robust line configuration under task processing time uncertainty. The robustness of a given line configuration is measured via its stability radius , i.e. , as the maximal amplitude of deviations from the nominal value of the processing time of uncertain tasks that do not violate the solution admissibility. In this work, for considering different hypotheses on uncertainty, the stability radius is based upon the Manhattan and Chebyshev norms. 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, two variants of a heuristic method as well as several reduction rules are devised for the corresponding MILP. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Transfer Line Balancing Problem.