Answers are grounded in this paper and cite their sources.
Historical note reviews early findings on scheduling problems and their complexity implications.
In 1972 E.M. Livshits and V.I. Rublinetsky published a paper in Russian, in which they presented linear-time reductions of the partition problem to a number of scheduling problems. Unaware of complexity theory, they argued that, since partition is not known to have a simple algorithm, one cannot expect to find simple algorithms for these scheduling problems either. Their work did not go completely unnoticed, but it received little recognition. We describe the approach and review the results.
No takes yet. Share an insight, caveat, or question.
Lenstra et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: