Dynamic Scheduling Of4S Auto Dealership Maintenance Service System

China has already become No.1auto market in the world. However, on the aspects of auto brand, research and development, sales and service, etc, there are gaps between and among China's automobile industry and that of the automobile superpower nations. Study on the dynamic scheduling problem of automobile4S shop's repair service system has value both in automobile industry and specific auto sales business. In addition, the results can also be applied to other service systems. Firstly, it analyzed the characteristics of the automobile4S shop's repair service system. Then, it described this problem as a dynamic FJSP problem with obvious bottleneck. At last, it simplified the scheduling problem of the complex system combined with the theory of constraints and the thought of system-decomposing. The research was broken down into three levels:Firstly, it solved the multi-objective dynamic scheduling problem of bottleneck resource in the4S shop; secondly, based on the first level, it built the dynamic scheduling strategy of the4S shop on the condition of single bottleneck; and thirdly it extended up to the multi-objective dynamic scheduling problem on the condition of multi-constraint. The study adopts the strategy of from simple to complex. Through the description of their characteristics and natures, it established a mathematical model, and targeted combination of scheduling algorithm and dynamic scheduling strategy. The main contents are shown as follows:Chapter1introduces the research's theoretical meaning and practical value, and then it analyzes the status quo of the service system's dynamic scheduling problem, from which to extract the specific object of study subjects-several solutions of automobile4S shop's repair service system scheduling problem. Then, point out the paper's technical line and the main research work combined with the summary of the status quo.Chapter2introduces the core concepts and management techniques of theory of constraints; then explain the problem description related parameters of the specific study object and use triple of α/β/γ method and comparative approach to describe the similarity of the scheduling problem between4S shop and manufacturing systems, including the characteristic of the first one; Finally, put up with the decomposition framework of the4S shop repair service system's dynamic scheduling problem which based on the constraint theory and the general idea of future research.Chapter3combined with the optimal scheduling theory makes a study on the workshop's bottleneck operation (painting process) scheduling problem's characteristic, models, and solution problem, puts up with the multi-objective scheduling strategy. First, analyze the feature of painting operation scheduling problem from the aspects of the minimized the objective, machine environment, processing characteristics and constraints, and establish the corresponding mathematical model. Second, design the dynamic scheduling algorithm with the combination of hybrid rescheduling strategy and two-stage algorithm. Third, use genetic algorithms, particle swarm optimization and improvement of plant growth simulation algorithm respectively to go on the second stage of getting the iterative solution on basis of the initial solution of this problem. Finally, use real examples to analyze and compare the performance of algorithms. Experimental results show that the improved plant growth simulation algorithm in the calculation of the time and the quality of reconciliation is superior.Chapter4makes a study on the dynamic scheduling problem of the4S shop's repair service system under the single-bottleneck environment. First of all, select the appropriate dispatch rules and re-scheduling policy to schedule the non-bottleneck resource on the basis of bottleneck resource's multi-objective scheduling results; Then, set the buffer between the bottleneck and non-bottleneck resources, manage the buffer, and establish coordination mechanisms of the bottleneck and non-bottleneck resource, to achieve the solution of services system's dynamic scheduling problem in the environment of single-bottleneck; Finally, verify the algorithm through the4S shop's repair service workshop's scheduling problem with the routing task.Chapter5makes a study on the4S shop repair system's dynamic scheduling problem under the multi-constraint environment. First, describe the problem, build the mathematical model, and establish the problem's decomposed framework on the basis of theory of constraints. Then, solve this problem through the improving constraint guided heuristic algorithm; improve the coordination mechanism between the constrained machines and non-constrained machines, and realize the solution of service system dynamic scheduling problem under the multi-constraint environment. Finally, take the4S shop repair service workshop with the peaking assignment as an example to verify the algorithm.Chapter6uses its algorithm to schedule the operations and resources in a specific4S shop repair service workshop. First of all, introduce automobile's after-sales maintenance services and the situation of the maintenance workshop. Then, use the proposed method to schedule the problem with the peaking day's data which will get a better scheduling scheme than the actual results in the shop. Finally, for the important and difficult scheduling points, propose the corresponding management strategy recommendations.Conclusion summarizes the main results of the paper, points out the innovation, and looks forward this subject's future work.