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

In this problem a finite set of jobs is processed on a finite set of machines . Each job is characterized by a fixed order of operations , each of which is to be processed on a specific machine for a specified duration . Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted . The objective of the problem is to find a schedule that minimizes the makespan of the jobs .

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

In this problem a finite set of jobs is processed on a finite set of machines . Each job is characterized by a fixed order of operations , each of which is to be processed on a specific machine for a specified duration . Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted . The objective of the problem is to find a schedule that minimizes the makespan of the jobs .

Back to list