Answers are grounded in this paper and cite their sources.
In this paper, we consider scheduling problems with slack (different) due-window assignment and time-dependent processing times. The processing time functions are all a proportional linear increasing function of time. On a single-machine setting, the goal is to minimize a cost function that includes earliness, tardiness, due-window starting time and size, and the number of early and tardy jobs. Some relevant optimality properties and polynomial time solution algorithms are proposed to solve these two problems.
No takes yet. Share an insight, caveat, or question.
Teng et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: