European Journal of Operational Research vol:4 issue:1 pages:42-48
Consider n jobs to be sequenced on a single machine. The objective functions to be minimized are the holding cost and the maximum tardiness. We first characterize the set of efficient points and then proceed to give a pseudo-polynomial algorithm to enumerate all these efficient points. Computational results illustrate the usefulness of the procedure.