Answers are grounded in this paper and cite their sources.
The problem of simultaneous determination of optimal due dates and optimal sequence for N-job single machine problem with multiple due dates is considered in this paper. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective is to minimize the total penalty for all jobs. An efficient optimal algorithm to solve the problem is developed and several results are provided.
No takes yet. Share an insight, caveat, or question.
Chand et al. (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: