عنوان مقاله [English]
In the automotive industry, final assembly lines are usually designed for the production of a large variety of cars. Different assembly processes are not only required by different equipment, but also because multiple types or even several different models are built on the same assembly line. These modern assembly lines are called mixed-model assembly lines. Because the distribution of the workload is highly dependent on the production sequence, the planning of the sequence, including how the orders go through the assembly line, is crucial for high utilization. A huge theoretical and practical effort has been undertaken in recent years to plan production optimally. An important decision problem in mass-producing customized product to order is the sequencing problem, which decides on the succession of models launched down an assembly line. The objective of car sequencing problem is to find an optimal permutation for a collection of cars sharing the same basic product model to be built in the same production line of car plants. Due to disturbances that occur during the supply and production process, the carefully planned production sequence often cannot be performed as intended. This paper treats the car sequencing problem in final assembly line with considering the unexpected occurrence of parts supply disturbance. In this regard a basic integer linear programming model is developed using GAMS software and based on that, problem solving algorithm according to a reactive approach with considering supply disturbance occurrence is presented. Then using a real example, proposed model and solution method is described. For evaluating the proposed method, sample problems in CSPLib have been used and for simulating the supply disturbance occurrence, in each sample problem one special part has been disturbed. Then proposed algorithm has been compared with continue of first sequence as a conventional method. Computational results indicate that solutions obtained by proposed method based on mathematical programming are optimum and preferable in comparison with alternating method.