Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 001 (Car Sequencing) — Constraint detection

A number of cars are to be produced ; they are not identical , because different options are available as variants on the basic model . The assembly line has different stations which install the various options -LRB- air-conditioning , sun-roof , etc. -RRB- . These stations have been designed to handle at most a certain percentage of the cars passing along the assembly line . Furthermore , the cars requiring a certain option must not be bunched together , otherwise the station will not be able to cope . Consequently , the cars must be arranged in a sequence so that the capacity of each station is never exceeded . For instance , if a particular station can only cope with at most half of the cars passing along the line , the sequence must be built so that at most 1 car in any 2 requires that option . The problem has been shown to be NP-complete -LRB- Gent 1999 -RRB- .

Problem 001 (Car Sequencing) — Detection of the decisions and objects to be modeled

A number of cars are to be produced ; they are not identical , because different options are available as variants on the basic model . The assembly line has different stations which install the various options -LRB- air-conditioning , sun-roof , etc. -RRB- . These stations have been designed to handle at most a certain percentage of the cars passing along the assembly line . Furthermore , the cars requiring a certain option must not be bunched together , otherwise the station will not be able to cope . Consequently , the cars must be arranged in a sequence so that the capacity of each station is never exceeded . For instance , if a particular station can only cope with at most half of the cars passing along the line , the sequence must be built so that at most 1 car in any 2 requires that option . The problem has been shown to be NP-complete -LRB- Gent 1999 -RRB- .

Back to list