We say that two permutations w and v have separated descents at position k if w has no descents before k and v has no descents after k. We give a counting formula in terms of reduced word tableaux for computing the structure constants of products of Schubert polynomials indexed by permutations with separated descents. This generalizes previous results by Kogan '00, rediscovered using different methods by Knutson-Yong '04, Lenart '10, and Assaf '17, that solved special cases of this separated descent problem where one of the permutations is required to have a single descent. Our approach uses generalizations of Schutzenberger's jeu de taquin and the Edelman-Greene correspondence via bumpless pipe dreams.