An alternative proof of optimality for the common due-date assignment problem

Abstract

For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.