Solving the Car Sequencing Problem with Cross-Ratio Constraints Using Constraint Programming Approach
Résumé
The rise of mass-individualization has underscored the significance of Mixed-Model Assembly Lines (MMALs) for producing diverse products on the same line. The Car Sequencing Problem (CSP) tackles short-term balanc-ing in an MMAL by emphasizing the use of spacing rules to manage the space between each pair of work-intensive products that possess specific characteristics. In this study, we tackle two challenges within the CSP con-text. The first challenge involves exploring CSP with cross-ratio constraints that takes into account the dependency between different characteristics. As the second challenge, we study the CSP under two states where spacing rule violations are not allowed (hard) and allowed (soft). We develop two con-straint programming models for the mentioned states and evaluate the per-formance of the models using several real-world assembly lines’ instances. The findings enhance understanding of each model’s strengths and weak-nesses. Given the inherent complexity of real-world problems, the soft mod-el may find more practical and effective application. This research enriches the realm of problem-solving in MMALs by offering valuable insights and introducing the main challenges in the CSP.