A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
[article]
2017
arXiv
pre-print
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 those problems whose objective is to minimize either the total (average) weighted completion time or the total (average) weighted flow time, which arise as particular cases when the due dates of all
arXiv:1509.02384v3
fatcat:octz3tl22zcz3id4vah337sef4