Optimization Research For Two-stage Hybrid Flow Engine Assembly Shop Scheduling Problem

With the continuous improvement of economy and living standards, car has become necessities. Under the guidance of Internet and communication technology rapid development, the demands for automobile products have become more and more personalized and diversified. While engine as the core component of automobile products, its quality has a great influence on the overall car quality. Enterprise constantly introduces advanced manufacturing technology and management methods to improve the production operation to rapidly response to the diverse needs of customers. Hybrid flow assembly line arises at the historic moment. Hybrid flow assembly line can be integrated with different material resources and human resources. It can produce different type of products which have similar processing craft without extending production period. While hybrid flow shop involving numerous different types products, it is particularly important that there is a reasonable and effective production scheduling scheme in the hybrid flow shop.The hybrid engine assembly flow shop scheduling problem is studied in this paper. Hybrid engine assembly workshop layout in an enterprise as an example, hybrid assembly flow shop scheduling problem is analyzed. Scheduling problem at the station where the cylinder is combined with the cylinder head is deeply analyzed and studied. Firstly, the practical scheduling problem is abstracted as a two stage hybrid assembly flow shop scheduling model to minimize the summation of the waiting time between the same type of cylinder and cylinder head at the first stage. A heuristic algorithm is proposed which can solve the problem effectively.Taking into account the condition that the practical scheduling problem is more complex, the setup time is considered. The multi-objective two stage hybrid assembly flow shop scheduling model is established to minimize makespan and the summation of the waiting time between the same type of cylinder and cylinder head at the first stage. The complexity of the problem is analyzed, and a heuristic algorithm is designed combining the characters and relationship among the model. In order to evaluate the performances of the proposed algorithm, a dynamic programming model is established. The computational experiment shows that the heuristic algorithm provides optimal and near-optimal solutions to the scheduling problems.