Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
From MaRDI portal
Publication:2494508
Recommendations
- The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Solving the capacitated lot-sizing problem with backorder consideration
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- A single-item lot-sizing problem with a by-product and inventory capacities
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
Cites work
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Mixing mixed-integer inequalities
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
Cited in
(20)- Uncapacitated lot sizing with backlogging: the convex hull
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Single-item dynamic lot-sizing problems: an updated survey
- Extended formulations for stochastic lot-sizing problems
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- Approximate extended formulations
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- Extended model formulation of the proportional lot-sizing and scheduling problem with lost demand costs
- LS-LIB: a library of tools for solving production planning problems
- Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system
- The Mixing Set with Divisible Capacities
- Uncapacitated lot-sizing with buying, sales and backlogging
- Solving the capacitated lot-sizing problem with backorder consideration
- Lot sizing with minimum order quantity
- On a class of mixed-integer sets with a single integer variable
- Integration of sales and operations: a dynamic mixed-integer programming game
- Single item lot-sizing with non-decreasing capacities
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
This page was built for publication: Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494508)
