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

This problem can be described as follows : a finite set of operations has to be processed on a given set of machines . Each operation has a specific processing time during which it may not be interrupted . Operations are grouped in jobs , so that each operation belongs to exactly one job . Furthermore , each operation requires exactly one machine for processing . The objective of the problem is to schedule all operations , i.e. , to determine their start time , so as to minimize the maximum completion time -LRB- makespan -RRB- given the additional constraints that : operations which belong to the same job and operations which use the same machine can not be processed simultaneously .

Problem Open-Shop_Scheduling — Detection of the decisions and objects to be modeled

This problem can be described as follows : a finite set of operations has to be processed on a given set of machines . Each operation has a specific processing time during which it may not be interrupted . Operations are grouped in jobs , so that each operation belongs to exactly one job . Furthermore , each operation requires exactly one machine for processing . The objective of the problem is to schedule all operations , i.e. , to determine their start time , so as to minimize the maximum completion time -LRB- makespan -RRB- given the additional constraints that : operations which belong to the same job and operations which use the same machine can not be processed simultaneously .

Back to list