Answers are grounded in this paper and cite their sources.
Given processing times of n jobs on a single machine with penalties for earliness and tardiness and penalties associated with assignment of due-dates, the objective is to select optimal due-dates and optimal sequence. Scheduling procedure for the solution of this problem is presented along with proof of optimality and illustrative numerical examples.
No takes yet. Share an insight, caveat, or question.
Seidmann et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: