We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximationâ€¦ (More)

In a one-machine nonpreemptive scheduling problem, the feasible schedules may be defined by the vector of the corresponding job completion times. For given positive processing times, the associatedâ€¦ (More)

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of theâ€¦ (More)

We provide a review and synthesis of polyhedral approaches to machine scheduling problems. The choice of decision variables is the prime determinant of various formulations for such problems.â€¦ (More)

We present a method for dynamically scheduling multi-priority patients to a diagnostic facility in a public health care setting. Rather than maximizing revenue for the diagnostic facility, theâ€¦ (More)

We study minimizing the sum of weighted completion times in a concurrent open shop. We give a primalâ€“dual 2-approximation algorithm for this problem. We also show that several natural linearâ€¦ (More)