Article ID: | iaor20141302 |
Volume: | 66 |
Issue: | 3 |
Start Page Number: | 519 |
End Page Number: | 524 |
Publication Date: | Nov 2013 |
Journal: | Computers & Industrial Engineering |
Authors: | Benyoucef Lyes, Bensmaine Abderrahmane, Dahane Mohammed |
Keywords: | heuristics: genetic algorithms |
This paper deals with a problem of reconfigurable manufacturing systems (RMSs) design based on products specifications and reconfigurable machines capabilities. A reconfigurable manufacturing environment includes machines, tools, system layout, etc. Moreover, the machine can be reconfigured to meet the changing needs in terms of capacity and functionality, which means that the same machine can be modified in order to perform different tasks depending on the offered axes of motion in each configuration and the availability of tools. This problem is related to the selection of candidate reconfigurable machines among an available set, which will be then used to carry out a certain product based on the product characteristics. The selection of the machines considers two main objectives respectively the minimization of the total cost (production cost, reconfiguration cost, tool changing cost and tool using cost) and the total completion time. An adapted version of the non‐ dominated sorting genetic algorithm (NSGA‐II) is proposed to solve the problem. To demonstrate the effectiveness of the proposed approach on RMS design problem, a numerical example is presented and the obtained results are discussed with suggested future research.