Scheduling Problem Of Reconfigurable Production Line Based On Hybrid Genetic Algorithm

Reconfigurable Manufacturing System One of the characteristics of modern manufacturing industry is the multiple-varieties and small-batches production comparing previous single-variety and large-batches one, which brings high demand on the flexibility of the manufacturing system. But the most studies focus on large and complicated system which the small and medium enterprises can't afford. This paper presents an approach to rebuild a Reconfigurable Production Line with low cost and increase the throughput of entire system by scheduling algorithm based on Reconfigurable Production Line. Then enterprises can not only decrease inventory but also reduce operational expense in order to enhance competence. The content of the paper includes the following:1. Define scheduling problem of Reconfigurable Manufacturing System with a thorough comprehension of RMS conception and characteristics. Then propose the scheduling problem of Reconfigurable Production Line combined with Theory of Constraints, which is established based on bottleneck.2. Find out bottleneck by TOC, and utilize reconfigurable cell to release productivity. Then setup the mathematical model which objective is synthetic scheduling index.3. Present a hybrid genetic algorithm to solve the scheduling problem of Reconfigurable Production Line which set capability of bottleneck as target. Bottlenecks are the objective of programming by which the former and the latter processes can be pulled or pushed. Redesign of mutation operator of genetic algorithm is completed by combination with the memory function of tabu search in order to form the hybrid algorithm. With the certification of experiment, this method show the result is satisfactory. Manufacturing systems can meet the changes of requirements effectively and rapidly.