A set of n jobs must be carried out on a single machine that can do only one job at a time. Each job j takes pj hours to complete. Given job weights $$j for j $=1,...,$ n$,$ in what order should the jobs be carried out so as to minimize the weighted sum of their start times? Formulate this scheduling problem as a mixed integer program.