An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

@article{Grosso2004AnED,
  title={An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem},
  author={Andrea Grosso and Federico Della Croce and Roberto Tadei},
  journal={Oper. Res. Lett.},
  year={2004},
  volume={32},
  pages={68-72}
}
Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results signi6cantly improve over those of Congram, Potts and Van de Velde. c © 2003 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
34 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

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

Generalized pairwise interchanges and machine scheduling

  • F. Della Croce
  • European J. Oper. Res. 83
  • 1995
2 Excerpts

S

  • C. N. Potts
  • Van de Velde, Dynasearch—iterative local…
  • 1995

A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness

  • E. L. Lawler
  • Ann. Discrete Math. 1
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…