摘要：Car sequencing is a popular approach to implicitly improve the short-term balancing of a mixed-model assembly line in real-world applications. In this paper, based on a real-world case from a truck final assembly line, we study this problem considering cross-ratio constraints which concern the limitations of some dependent features of products. A mathematical programming model is developed to minimize the total weighted penalty of disrespecting the independent and dependent limitations. Since the problem is NP-hard, a multi-start parallel local search is developed to efficiently solve the problem. A comparison of the results illustrates the effectiveness of using the proposed algorithm.
