New algorithms solve Pm||∑w_j C_j and Pm||L_max in O(p_max^{2m-2} n) time and Pm||∑w_j U_j in O(p_max^{2m-1} n^2) time by proving that optimal schedules have machine load differences bounded by 4 p_max^2 for job prefixes.
Conway, William L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lawler-Moore Speedups via Additive Combinatorics
New algorithms solve Pm||∑w_j C_j and Pm||L_max in O(p_max^{2m-2} n) time and Pm||∑w_j U_j in O(p_max^{2m-1} n^2) time by proving that optimal schedules have machine load differences bounded by 4 p_max^2 for job prefixes.