Answers are grounded in this paper and cite their sources.
We consider a static, deterministic, n jobs-single machine model in which jobs have release dates that can be expedited, if needed, to keep the machine busy without idle time. The objective is to minimise the number of expedited jobs. We propose a polynomially-bounded solution procedure [O(n log n)] that is antithetic to a well-known procedure for minimising the number of tardy jobs.
No takes yet. Share an insight, caveat, or question.
S. S. Panwalkar (2013) studied this question.
Synapse has enriched 7 related papers. Consider them for comparative context: