This paper considers a single machine scheduling problem with generalized due-dates (GDD) to minimize the maximum earliness and tardiness. Under the assumption of GDD, due-dates are not job-dependent but rather associated with the number of jobs previously processed. First, we prove that the...

The coupled task scheduling problem aims to schedule a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. We study the problem of scheduling a set of coupled jobs to be processed on...