Assignment stochastic algorithm in multi-product assembly lines

The reconfigurability potential of an assembly line depends on tasks-to-workstations assignments which are available on the occurrence of an unpredictable event. To define the assignment problem, one has to consider a good representation of assembly plans that can be obtained in a systematic way. This is a very difficult task in the case of multi-product assembly lines. In this context, the authors propose an approach for the assignment problem which is based upon two main ideas. The first one is a graph representation of the assembly plan for a product family, assuming the existence of “generic” assembly graph. It is a generalization of assembly graph, which is an assembly plan for single product assembly line. The second idea is to use a stochastic algorithm for solving the assignment problem regarded as a optimality problem