Solutions and Solution Costs for "Exact and Meta-Heuristic Approaches for Unrelated Parallel Machine Scheduling"

This record contains the solutions and solution costs described in the journal paper "Exact and metaheuristic approaches for unrelated parallel machine scheduling".

Content

The ZIP archives contain the actual solution files (.soln) for each of the solver runs per instance.
Additionally, information files (.soln.info) are provided which contain a bit of extra information for the corresponding solution file.

The Excel sheets (.xlsx) contain the calculated solution costs as either Tardiness / Makespan pair, or as weighted sum as described in the paper.

Format of the Solution Files

The solution files start with a line containing the header [Schedules].
After this follows a CSV-style description of the schedules (with semicolon as separator) – the first column denotes the machine ID, while all following entries denote the job IDs, in order of their schedule on the corresponding machine.

Example

[Schedules]
0;1;5;3
1;4;2

This solution means that jobs 1, 5, and 3 are scheduled to run in this order on machine 0.
Similarly, machine 1 runs jobs 4 and 2 in this order.