Car sequencing problems arise in the automotive industry. There, a factory assembly line makes it possible to build many different types of cars, where the types correspond to a basic model with added options. In that context, one type of vehicle can be seen as a particular configuration of options. Even without loss of generality, it can be assumed that it is possible to put multiple options on the same vehicle while it is on the line. In that way, virtually any configuration (taken as an isolated case) could be produced on the assembly line. In contrast, for practical reasons (such as the amount of time needed to do so), a given option really cannot be installed on every vehicle on the line. This constraint is defined by the "capacity" of an option. The capacity of an option is usually represented as a ratio p/q where for any sequence of q cars on the line, at most p of them will have that option.

The problem in car sequencing consists of determining in which order cars corresponding to each configuration should be assembled, while keeping in mind that a certain number of cars per configuration must be built.

The example discussed is the Second Model in the example file YourSolverHome/examples/src/carseq.cpp.