Supply Chain Network Design: Applying Optimization and Analytics to the Global Supply Chain (FT Press Operations Management)

Using strategic supply chain network design, companies can achieve dramatic savings from their supply chains. Now, experts at IBM and Northwestern University have brought together both the rigorous principles and the practical applications you need to master. You’ll learn how to use supply chain network design to select the right number, location, territory, and size of warehouses, plants, and production lines; and optimize the flow of all products through your supply chain even if extends around the globe. The authors present better ways to decide what to manufacture internally, where to make these products, which products to outsource, and which suppliers to use. They guide you in more effectively managing tradeoffs such as cost vs. service level, improving operational decision-making by integrating analytics throughout supply chain management; and re-optimizing regularly for even greater savings. Supply Chain Network Design combines best practices, the latest methods in optimizati

Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control)

An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and discrete/combinatorial network optimization problems, their applications, and their analytical and algorithmic methodology. It covers extensively theory, algorithms, and applications, and it aims to bridge the gap between linear and nonlinear network optimization on one hand, and integer/combinatorial network optimization on the other. Among its special features, the book: 1) provides a comprehensive account of the principal algorithms for linear network flow problems, including simplex, dual ascent, and auction algorithms 2) describes the application of network algorithms in many practical contexts, with special emphasis on data communication networks 3) develops in detail the computational complexity analysis of the main linear network optimization algorithms 4) covers extensively the main algorithms for specialized network problems, such as shortest path, max-flow, assignment, and traveling salesman 5)