Answers are grounded in this paper and cite their sources.
We consider a basic single-machine scheduling problem when jobs have release and delivery times and the objective is to minimize maximum job lateness. This problem is known to be strongly NP-hard. We study inherent structure of this problem exploring its special cases and the conditions when the problem can be efficiently solved.
No takes yet. Share an insight, caveat, or question.
Chinos et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: