A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems

This work proposes a unified heuristic algorithm for a large class of earliness–tardiness (E–T) scheduling problems. We consider single/parallel machine E–T problems that may or may not consider some additional features such as idle time, setup times and release dates. In addition, we also consider...

Ausführliche Beschreibung