Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

@article{Valente2005FilteredAR,
  title={Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time},
  author={Jorge M. S. Valente and Rui A. F. S. Alves},
  journal={Computers & Industrial Engineering},
  year={2005},
  volume={48},
  pages={363-375}
}
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present heuristic algorithms based on the filtered and recovering beam search techniques and compare them with existing neighbourhood search and dispatch rule heuristics. Filtering procedures using both priority evaluation functions and problem-specific properties have been considered. Extensive preliminary tests were performed to determine appropriate parameter values for the beam search… CONTINUE READING
26 Citations
14 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Filtered beam search in scheduling

  • P. S. Ow, T. E. Morton
  • International Journal of Production Research
  • 1988
Highly Influential
10 Excerpts

A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem

  • F. Della Croce, V. T’kindt
  • Journal of the Operational Research Society
  • 2002
2 Excerpts

Single machine earliness and tardiness scheduling

  • G. Li
  • European Journal of Operational Research
  • 1997
3 Excerpts

Dynamic programming state-space relaxation for single machine scheduling

  • T. Abdul-Razaq, C. N. Potts
  • Journal of the Operational Research Society
  • 1988
3 Excerpts

Viewing scheduling an an opportunistic problemsolving process

  • P. S. Ow, S. F. Smith
  • Annals of Operations Research
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…