On the N-Job, One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution (Classic Reprint)