Probabilistic Analysis of Packing and Partitioning Algorithms

Provides an examination of two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling, and packing and partitioning. These classes of problems are shown to encompass a range of practical applications, such as production planning and VLSI design.

---

This volume examines two important classes that are characteristic of combinatorial optimization problems: sequencing and scheduling (in which a set of objects has to be ordered subject to a number of conditions), and packing and partitioning (in which a set of objects has to be split into subsets in order to meet a certain objective). These classes of problems encompass a wide range of practical applications, from production planning and flexible manufacturing to computer scheduling and VLSI design.