Due-window assignment with identical jobs on parallel uniform machines

► We study a scheduling problem of identical jobs on parallel uniform machines. ► A common due-window is assumed, and job-dependent earliness/tardiness unit costs are considered. ► The objective function is minimum total earliness/tardiness cost. ► A non-restrictive and restrictive due-window are studied. ► We introduce efficient polynomial-time algorithms for both cases.