A BI-OBJECTIVE OPTIMIZATION ALGORITHM FOR AUTOMOBILE MANUFACTURING SCHEDULING

In automobile manufacturing, it is a great challenge to select and execute the services with the optimal value, cost and time out of complex processes. Most traditional algorithms only optimize one objective. In this paper, an optimization algorithm for service value and time is proposed under the constraint of deadline, and denoted as SRVT. The proposed algorithm reversely derives the service with the maximum value at each time point, and adds it to the set of candidate solutions in the next iteration. Then, the optimal solutions were selected iteratively from the set. In the end, the maximum service value of the entire workflow was obtained. The proposed SRVT was compared with two traditional algorithms through a case study. The comparison shows that our algorithm can outperform the contrastive algorithms to a certain extent, and strike a balance between service time, service cost and service quality.