An efficient procedure for solving a car sequencing problem

In order to prepare the supply of the assembly workshop, a pre-sequencing of cars is carried out before the soldering shop, representing a certain number of production days. Moreover, each car has a due date, which indicates the date the car must be on the assembly line. Out goal is to provide a very fast algorithm (real time constraint) to develop a computer-aided car sequencing system for the assembly shop. This algorithm must realize a trade-off between speed and efficiency. This paper first describes the car sequencing problem and how it can be made into a cost function. The problem of optimization is then detailed