Abstract We study two $$\mathcal {NP}$$ NP -hard single-machine scheduling problems with generalized due-dates. In such problems, due-dates are associated positions in the job sequence rather than jobs. Accordingly, that is assigned to position j processing order (job sequence), a predefined due-date, $$\delt...