Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
From MaRDI portal
Publication:4286933
DOI10.1287/MOOR.18.4.767zbMATH Open0808.90058OpenAlexW2044758517MaRDI QIDQ4286933FDOQ4286933
Authors: Yves Pochet, Laurence A. Wolsey 
Publication date: 15 March 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.18.4.767
Recommendations
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- The application of valid inequalities to the multi-stage lot-sizing problem
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Economic lot sizing with constant capacities and concave inventory costs
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Valid inequalities and separation for capacitated economic lot sizing
- Extended formulations for stochastic lot-sizing problems
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
Linear programming (90C05) Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)
Cited In (54)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Lot-sizing on a tree
- Discrete multi-module capacitated lot-sizing problems with multiple items
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- A maritime inventory routing problem: discrete time formulations and valid inequalities
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Single item lot-sizing with non-decreasing capacities
- Approximation algorithms for supply chain planning and logistics problems with market choice
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Single-item dynamic lot-sizing problems: an updated survey
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Decomposition and mean-field approach to mixed integer optimal compensation problems
- Source sink flows with capacity installation in batches
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
- Algorithms and extended formulations for one and two facility network design
- Mixing MIR inequalities with two divisible coefficients
- Modeling industrial lot sizing problems: a review
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines
- On formulations of the stochastic uncapacitated lot-sizing problem
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- A polyhedral study of lot-sizing with supplier selection
- Relaxations for two-level multi-item lot-sizing problems
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Capacitated lot-sizing problem with outsourcing
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- Polynomial-time solvability of dynamic lot size problems
- Lot sizing with minimum order quantity
- Convex hull results for generalizations of the constant capacity single node flow set
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Dynamic coordination games with activation costs
- Title not available (Why is that?)
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- Polynomial cases of the economic lot sizing problem with cost discounts
- Multi-item lot-sizing with joint set-up costs
- Cutting planes in integer and mixed integer programming
- Minimising bins in transmission systems
- Capacitated lot sizing problems with inventory bounds
- Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Progress with single-item lot-sizing
- Lot-sizing with production and delivery time windows
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
This page was built for publication: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286933)
