Improving Local Search Heuristics for some Scheduling Problems. Part II

@article{Brucker1997ImprovingLS,
  title={Improving Local Search Heuristics for some Scheduling Problems. Part II},
  author={Peter Brucker and Johann Hurink and Frank Werner},
  journal={Discrete Applied Mathematics},
  year={1997},
  volume={72},
  pages={47-69}
}
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems Pm )I C,,,,, 1 1 prec 1 1 Ui, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that are… CONTINUE READING
25 Extracted Citations
7 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

The complexity of onemachine batching problems , Discrete Appl

  • P. Brucker
  • 1993

Optimization and approximation in deterministic sequencing and scheduling : a survey

  • E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan
  • Ann . of Discrete Math
  • 1990

Similar Papers

Loading similar papers…