Every language in NP reduces to single-machine scheduling with release times, deadlines and lengths in ${3, 2}$ (lax-391470). A Turing machine turns the binary word into its bits, and two word RAM programs, transferred to Turing machines (lax-759944), read the instance off the bits (the tokenizer of lax-391470) and write the standard word of $1|r_j|L_max$: every time is shifted up by the largest absolute value, release times become release dates and deadlines due dates, and the threshold is $0$. A word that is not an instance on the two lengths goes to the instance without jobs and threshold $-1$.