Valente, Jorge M. S.; Alves, Rui A. F. S. - Faculdade de Economia, Universidade do Porto - 2003
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had...