An experimental analysis of local minima to improve neighbourhood search

@article{Steinhfel2003AnEA,
  title={An experimental analysis of local minima to improve neighbourhood search},
  author={Kathleen Steinh{\"o}fel and Andreas Alexander Albrecht and Chak-Kuen Wong},
  journal={Computers & OR},
  year={2003},
  volume={30},
  pages={2157-2173}
}
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… CONTINUE READING