Edward Grady Coffman

George S. Lueker

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

Probabilistic Analysis of Packing and Partitioning Algorithms

Peter J. Denning

Edward G. Coffman, Jr.

“The principal object of this book is studying algorithms arising in the design of computer operating systems” -- Preface.

Edward Grady Coffman

About

Books

Join the club