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.

This paper provides a new approach to solving the three-dimensional packing problem. The heuristic developed uses a multi-faced buildup technique in the packing procedure for which there is no requirement for packed boxes to form flat layers. The basic algorithm is then augmented by a Look-ahead...