This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date. The objective is to minimize the total sum of earliness/tardiness costs. Using some properties such as V-Shaped property, optimizing start times machines, and no idle time between successive jobs, we propose effective construction-based heuristics local search algorithms for problem. var...

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent asymmetric earliness tardiness unit costs. scheduler may process only subset of the jobs, i.e. option job-rejection is allowed. objective function consists three cost components: total earliness-tardiness all scheduled due-date, rejection cos...