Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
From MaRDI portal
Publication:1026766
DOI10.1016/j.ejor.2008.08.026zbMath1163.90658OpenAlexW2110697145MaRDI QIDQ1026766
Publication date: 29 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.026
integer programmingcutting plane algorithmflow cover inequalitiessingle-item capacitated lot sizing problem
Related Items
Polynomial-Time Solvability of Dynamic Lot Size Problems, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Single-item dynamic lot-sizing problems: an updated survey, Production lot-sizing with dynamic capacity adjustment, NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract, Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost, Robust formulations for economic lot-sizing problem with remanufacturing, A Lagrangian heuristic for capacitated single item lot sizing problems, The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
Cites Work
- On the facets of the mixed-integer knapsack polyhedron
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Single item lot sizing problems
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Valid Linear Inequalities for Fixed Charge Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- On the facial structure of set packing polyhedra
- Single‐warehouse multi‐retailer inventory systems with full truckload shipments
- Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- Production Planning by Mixed Integer Programming
- Optimal Inventory Policy with Multiple Set-Up Costs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Mixing mixed-integer inequalities
