Production Planning by Mixed Integer Programming

Description

Stemming from the previous work of Wolsey and others, the book aims to be a cook-book of sorts, helping the practitioner to pick the right formulation to be fed into a modern general purpose integer programming solver. Hiding most of the underlying polyhedral theory behind computational experience with Dash Xpress-MP, the treatment truly is applicable. The book assumes little knowledge but basic linear algebra. In more than 170 pages, Chapters 1-3, 6, and 8 provide a very up-to-date, but not overly rigorous introduction to integer programming and production planning with emphasis is on mixed integer rounding and mixing sets, heuristics in-built in general purpose integer programming solvers, decompositions, and heuristics using integer programming. Classification of lot-sizing problems and their integer programming formulations is provided in Chapter 4. Uncapacitated (LS-U), constant capacitated (LS-CC), and general capacitated (LS-C) single-item lot-sizing problems, both continuous and discrete, are covered in some detail in Chapters 7 and 9. Chapter 10 covers extensions involving backlogging and start-up times. Finally, multi-item problems are touched upon in Chapter 11. For a full review, see DOI 10.1093/comjnl/bxm071 (http://dx.doi.org/10.1093/comjnl/bxm071).