Bounded Production and Inventory Models with Piecewise Concave Costs
From MaRDI portal
Publication:4085476
Cited in
(59)- A linear-time algorithm for finding optimal vehicle refueling policies
- A dynamic production scheduling model with lost-sales or backlogging
- A two-echelon inventory optimization model with demand time window considerations
- A note on ``The economic lot sizing problem with inventory bounds
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Finding Optimal Refueling Policies in Transportation Networks
- Multi-item uncapacitated lot sizing problem with inventory bounds
- Economic lot sizing problem with inventory dependent demand
- Improved algorithms for dynamic lot sizing problems with incremental discount
- Just-in-time planning and lot-sizing
- Single-item dynamic lot-sizing problems: an updated survey
- Economic lot sizing problem with tank scheduling
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- Modeling industrial lot sizing problems: a review
- Minimizing the error bound for the dynamic lot size model
- Combined replenishment and warehousing with contract commitments and flexibilities
- Two-stage fuzzy production planning expected value model and its approximation method
- The economic lot-sizing problem with perishable items and consumption order preference
- A capacity constrained singlefacility dynamic lot-size model
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- Single-item lot-sizing with quantity discount and bounded inventory
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Exact algorithms for integrated facility location and production planning problems
- Polynomial-time solvability of dynamic lot size problems
- An effective algorithm for the capacitated single item lot size problem
- Convex hull results for generalizations of the constant capacity single node flow set
- Lot sizing with bounded inventory and lost sales
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities
- Error bound for the dynamic lot size model with backlogging
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- Production allocation with dual provisioning
- A branch-and-cut algorithm for an assembly routing problem
- A polynomial algorithm for the production/ordering planning problem with limited storage
- Two-level lot-sizing with inventory bounds
- Capacitated lot sizing problems with inventory bounds
- Capacitated production planning with outsourcing in an OKP company
- A large-scale multilocation capacity planning model
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
- Dynamic lot-sizing model for major and minor demands
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- Multifacility in-series production-planning model with capacity constraints
- Capacity expansion planning for a single facility product line
- An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
- Single item lot sizing problems
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Facets and algorithms for capacitated lot sizing
- A new characterization for the dynamic lot size problem with bounded inventory
- A Lagrangian heuristic for capacitated single item lot sizing problems
- Production planning with time-dependent capacity bounds
- Economic lot sizing problem with inventory bounds
- Lot-sizing with production and delivery time windows
- Four equivalent lot-sizing models
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- Joint optimization of dynamic lot and warehouse sizing problems
This page was built for publication: Bounded Production and Inventory Models with Piecewise Concave Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085476)
