A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An experimental analysis of local minima to improve neighbourhood search
2003
Computers & Operations Research
The paper reports a number of experiments with local search algorithms applied to job shop scheduling. The main aim was to get insights into the structure of the underlying conguration space. We consider the disjunctive graph representation where the objective function of job shop scheduling is equal to the length of longest paths. In particular, we analyse the number of longest paths, and our computational experiments on benchmark problems provide evidence that in most cases optimal and near
doi:10.1016/s0305-0548(02)00128-4
fatcat:rtk5nmgbqjgotmqtwmzlwur43e