We consider the scheduling problem of minimizing the average wighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on time-indexed formulation, the other on a completion-time formulation. We show...

Given a network, the facility location problem consists of locating a set of sites on the network to serve existing clients so as to minimize its total cost. Special cases include the simple plant location problem (SPLP), bank account location, p-facility location, and p-median problem.

In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirements varies as the job is...