Optimization criterion: minimize the accumulated non-negative delay.
Schedule neighborhood: All schedules acquired by a pair-wise swap of neighboring tasks.
Schedule selection from neighborhood: Finds the best schedule for each step from the neighborhood.
Tabu list: pairs of tasks, swapped in last 11 modifications.
There are 15 tasks with names from „1“ to „15“.
The initial schedule is [2, 3, 15, 6, 5, 10, 8, 7, 13, 14, 1, 4, 12, 9, 11].
Task lengths are (4, 16, 6, 5, 9, 19, 1, 13, 12, 20, 20, 19, 5, 18, 12).
Deadlines are (36, 67, 105, 53, 77, 124, 194, 157, 25, 202, 43, 61, 5, 7, 8).
Weights are (21, 45, 35, 73, 1, 28, 21, 14, 76, 70, 51, 23, 69, 62, 80).
Perform 200 iterations.