The name of each problem instance conforms to i<n>_<MC>_<k>
- n is the number of jobs
- MC is the Maximum Capacity
- k is an identification number for the problem instance of the specific set
In total 190 problem instances exist.
Format of problem instances
An example:
NOP: 12
NINT: 6
0 2 1
2 4 2
4 6 3
6 10 4
10 12 3
12 300000 2
1 4 4
2 4 9
3 2 13
4 3 4
5 4 7
6 3 8
7 2 10
8 3 3
9 2 13
10 3 5
11 3 9
12 5 7
Explanation of the above format
NOP: followed by the number of jobs
NINT: followed by the number of intervals
NINT rows with time intervals: from to capacity
NOP rows with jobs: id duration due
Format of problem solutions
8 0 0
4 1 2
10 0 3
1 2 4
6 1 5
11 0 6
2 1 8
5 3 6
12 0 9
7 2 8
9 1 12
3 2 10
Explanation of the above format
Each row refers to a job id, the lane id where it is put and the start time of the job
A graphical representation of the solution (lanes are the horizontal strips of the capacity, numbered bottom-up)
