Introduction and Purpose. The Knapsack Problem. Set Covering, Packing, and Partitioning. The Generalized Assignment Problem. Incapacitated Economic Lot Sizing. Capacitated Lot Sizing. Discrete Facility Location Problems. Vehicle Routing and Traveling Salesman Problems.
Joseph Geunes has been on the faculty of the Industrial and Systems Engineering Department at the University of Florida since 1998. His research focuses on applying operations research techniques to large-scale production and logistics planning problems. Professor Geunes serves as Co-Director of the Supply Chain And Logistics Engineering (SCALE) Research Center and as Director of the Outreach Engineering Management professional Master’s Degree program at the University of Florida. He has co-authored more than 30 peer-reviewed journal articles, which have appeared in journals such as Operations Research, Manufacturing & Service Operations Management, IIE Transactions, and Naval Research Logistics. He also serves as an Associate Editor for OMEGA, Computers & IE, and Decision Sciences, and is on the editorial boards of Production and Operations Management and the International Journal of Inventory Research. Professor Geunes received a Ph.D. (1999) and MBA (1993) from Penn State University, as well as a B.S. in Electrical Engineering (1990) from Drexel University.
"The book under review gathers several of the most useful models
for optimization with widespread applicability in operation
planning. ... With the exception of Chapter 1, each chapter
contains several numerical examples and ends with a set of
exercises. This approach makes the book very helpful for a graduate
course on mixed integer optimization models for non-mathematically
oriented, business administration students. With its precise
references to a bibliography of 120 titles ranging from 1954 to
2010, the book can serve well as a reference for researchers in the
domain of operations planning."
—Mihai Cipu (Bucureşti), Zentralblatt MATH, 1327
"The book provides a technically sound, yet very readable,
description of various state-of-the-art mathematical programming
techniques that can be used to tackle relevant operations planning
problems. In early chapters, important mathematical programming
concepts are introduced in the context of archetypical optimization
problems, such as the knapsack and the set covering problem. In
later chapters, the book covers all classical operations planning
problems; i.e., problems in production planning (single and
multi-stage), distribution planning, location, and routing.
Although none of the material is really new, it is nice to have it
well-presented in a single book instead of scattered among various
journal papers. Where appropriate, the material is illustrated with
meaningful numerical examples and figures. Moreover, every chapter
is concluded with challenging exercises, making this book suitable
for courses at the advanced undergraduate or graduat level. Because
it covers a wide range of techniques, the book can also be used to
introduce readers to various concepts in mathematical programming,
even if they don’t have a particular interest in operations
planning. In that case, the specific operations planning problems
merely serve to illustrate the techniques."
—Albert P.M. Wagelmans, Erasmus University Rotterdam, The
Netherlands
|
Ask a Question About this Product More... |
|
