Optimal design of capacitated production networks
From MaRDI portal
Publication:2443400
Recommendations
- The design of production-distribution networks: a mathematical programming approach
- Optimal planning in large multi-site production networks
- scientific article; zbMATH DE number 2087381
- Approximability of capacitated network design
- Approximability of capacitated network design
- Capacity planning in manufacturing networks with discrete options
- An optimal capacity assignment for the robust design problem in capacitated flow networks
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Optimal design of production lines
- Capacitated Network Design—Polyhedral Structure and Computation
Cites work
- A continuum-discrete model for supply chains dynamics
- A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations
- A dual ascent approach to the fixed-charge capacitated network design problem
- A fluid dynamic model for supply chains
- A Model for the Dynamics of large Queuing Networks and Supply Chains
- A theory of supply chains
- Credit chains and bankruptcy propagation in production networks
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Dynamic supply chain design with inventory
- Modelling and optimization of supply chains on complex networks
- Network models for supply chains
- Optimal control for continuous supply network models
Cited in
(9)- Minimal processes of limited capacity in production networks
- Capacity planning in manufacturing and computer networks
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Modeling and optimizing traffic light settings in road networks
- A manufacturing network design model based on processor and worker capabilities
- Optimal Power-of-Two Replenishment Strategies in Capacitated General Production/Distribution Networks
- Achieving optimal design of the production line with obtainable resource capacity
- Maximal flow network modelling of production bottleneck problems
- A dual tailored branch-and-bound algorithm for quadratic mixed-integer problems. Applied to production models with buffers
This page was built for publication: Optimal design of capacitated production networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443400)
