Minimum concave cost production system: A further generalization of multi-echelon model
From MaRDI portal
Publication:1114584
DOI10.1007/BF01580763zbMath0662.90037MaRDI QIDQ1114584
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
concave minimization; polynomial time algorithm; backlogging; processing; holding; series production system
68Q25: Analysis of algorithms and problem complexity
90B30: Production models
90B10: Deterministic network models in operations research
Related Items
Resource downgrading, A survey of dynamic network flows, Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems, Linear multiplicative programming, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, A heuristic method for lot-sizing in multi-stage systems, The application of valid inequalities to the multi-stage lot-sizing problem, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Echelon stock formulation for multi-stage lot-sizing with component lead times
Cites Work
- Unnamed Item
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Minimum Concave Cost Flows in Certain Networks
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- A Facilities in Series Inventory Model with Nested Schedules
