AbstractThis note considers the n-job, one-machine scheduling problem with common due-dates. Previous research has shown that the optimal value of the common due-date coincides with one of the job completion times for a given job sequence. In this note, we propose a linear programming (L.P.) formulation of the problem and obtain the same optimal result via considering the L.P. dual problem.