Pages that link to "Item:Q4085476"
From MaRDI portal
The following pages link to Bounded Production and Inventory Models with Piecewise Concave Costs (Q4085476):
Displaying 50 items.
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
- Two-stage fuzzy production planning expected value model and its approximation method (Q449326) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (Q507343) (← links)
- Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities'' (Q545126) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- Capacity expansion planning for a single facility product line (Q795708) (← links)
- A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668) (← links)
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
- Four equivalent lot-sizing models (Q1003497) (← links)
- A dynamic production scheduling model with lost-sales or backlogging (Q1092803) (← links)
- A large-scale multilocation capacity planning model (Q1101333) (← links)
- Production planning with time-dependent capacity bounds (Q1159564) (← links)
- A capacity constrained singlefacility dynamic lot-size model (Q1245141) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- Production allocation with dual provisioning (Q1333522) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- Joint optimization of dynamic lot and warehouse sizing problems (Q1754258) (← links)
- Two-level lot-sizing with inventory bounds (Q1756341) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- Minimizing the error bound for the dynamic lot size model (Q1904609) (← links)
- A note on ``The economic lot sizing problem with inventory bounds'' (Q1927015) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Economic lot sizing problem with inventory dependent demand (Q2228391) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity (Q2294332) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
- Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
- Economic lot sizing problem with inventory bounds (Q2456418) (← links)
- A linear-time algorithm for finding optimal vehicle refueling policies (Q2467464) (← links)
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
- Error bound for the dynamic lot size model with backlogging (Q2638915) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
- Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
