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 Open_Stack — Constraint detection

A manufacturer has a number of orders from customers to satisfy ; each order is for a number of different products , and only one product can be made at a time . Once a customer 's order is started -LRB- i.e. the first product in the order has been made -RRB- a stack is created for that customer . When all the products that a customer requires have been made , the order is sent to the customer , so that the stack is closed . Because of limited space in the production area , the number of stacks that are in use simultaneously i.e. the number of customer orders that are in simultaneous production , should be minimized . More formally : we are given a Boolean matrix in which the columns correspond to the products required by the customers and each row corresponds to the order of a particular customer . The entry c_ij = 1 iff customer i has ordered some quantity of product j -LRB- the quantity ordered is irrelevant -RRB- . The objective is to find a permutation of the products such that the maximum number of open orders at any point in the sequence is minimized : order i is open at point k in the production sequence if there is a product required in order i that appears at or before position k in the sequence and also a product that appears at or after position k in the sequence .

Problem Open_Stack — Detection of the decisions and objects to be modeled

A manufacturer has a number of orders from customers to satisfy ; each order is for a number of different products , and only one product can be made at a time . Once a customer 's order is started -LRB- i.e. the first product in the order has been made -RRB- a stack is created for that customer . When all the products that a customer requires have been made , the order is sent to the customer , so that the stack is closed . Because of limited space in the production area , the number of stacks that are in use simultaneously i.e. the number of customer orders that are in simultaneous production , should be minimized . More formally : we are given a Boolean matrix in which the columns correspond to the products required by the customers and each row corresponds to the order of a particular customer . The entry c_ij = 1 iff customer i has ordered some quantity of product j -LRB- the quantity ordered is irrelevant -RRB- . The objective is to find a permutation of the products such that the maximum number of open orders at any point in the sequence is minimized : order i is open at point k in the production sequence if there is a product required in order i that appears at or before position k in the sequence and also a product that appears at or after position k in the sequence .

Back to list