A set of tasks (or jobs) is to be processed on a single machine. The execution of tasks is non-preemptive (that is, an operation may not be interrupted before its completion). For every task its release date, due date, and duration are given. The model shows how to minimize the total processing time, the average processing time, and the total tardiness (that is, the amount of time by which the completion of jobs exceeds their respective due dates).

Further explanation of this example: 'Applications of optimization with Xpress-MP', Section 7.4 'Sequencing jobs on a bottleneck machine' (b4seq.mos)

! Datafile for 'sequencing.mos'

REL: [ 2  5  4  0  0  8  9]
DUR: [ 5  6  8  4  2  4  2]
DUE: [10 21 15 10  5 15 22]