In the paper, we consider a single-machine scheduling problem with generalized due dates, in which objective is to minimize total weighted work. This was proven be NP-hard by Mosheiov et al. [1]. However, exact complexity remains open. We show that strongly NP-hard, and weakly if lengths of intervals between consecutive dates are identical.