The data for this problem are available online with your installation of the product in the file yourCPLEXhome/examples/data/etsp.dat.

The data of this example consists of arrays and arrays of arrays (that is, matrices).

One array of arrays represents the resources required for each activity of a job. For example, job0 entails eight activities, and those eight activities require the following ordered list of resources:

1, 3, 4, 1, 2, 4, 2, 4

A second array of arrays represents the duration required for each activity of a job. For job0, the following ordered list represents the duration of each activity:

41, 32, 72, 65, 53, 35, 53, 2

In other words, job0 requires resource1 for a duration of 41 time units; then job0 requires resource3 for 32 time units, and so forth.

There is also an array representing the due date of each job. That is, array[i] specifies the due date of jobi.

To represent the penalty for the early completion of each job, there is an array of penalties.

Likewise, to represent the penalty for late completion of each job, there is an array of penalities for tardiness.