Combining the large-step optimization with tabu-search : application to the job-shop scheduling problem

@inproceedings{Loureno1996CombiningTL,
  title={Combining the large-step optimization with tabu-search : application to the job-shop scheduling problem},
  author={Helena R. Lourenço and Michiel Zwijnenburg},
  year={1996}
}
In Section 2, we review local optimization methods, as local improvement and simulated annealing, and a two-phase optimization method, known as large-step optimization, which has recently been introduced for the traveling salesman problem. The first phase of this new method consists of a large optimized transition in the current solution, while the second phase is basically a local search method. The main advantage of the large-step optimization methods is the use of optimization and tailored… CONTINUE READING

References

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

H . R . Lourenço , Job - Shop Scheduling : Computational Study of Local Search and Large - Step Optimization Methods

  • D. S Johnson, C. R. Aragon, C. Schevon
  • Optimization by Simulated Annealing : an…
  • 1994

Job-Shop Scheduling: Computational Study of Local Search and Large-Step Optimization Methods", to appear in European Journal of Operational Research. Lucks, V.B.F

  • H. R. Lourenco
  • 1994
2 Excerpts

The One-Machine Sequencing Problem", European Journal of Operational Research, 11:42-47

  • J. Carlier
  • Annals of Operations Research,
  • 1982
2 Excerpts

Similar Papers

Loading similar papers…