Answers are grounded in this paper and cite their sources.
In this study, we consider single-machine scheduling problems with past-sequence-dependent (denoted by psd) setup times in which the setup times of jobs are proportional to the length of already processed jobs. Under common (CON) and slack (SLK) due-date assignment methods, we prove that the weighted sum of earliness, tardiness and due-date minimization remains polynomially solvable. We also give some extensions for the scheduling problems with psd setup times.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: