Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

DOI10.1287/MOOR.18.4.767zbMath0808.90058OpenAlexW2044758517MaRDI QIDQ4286933

Laurence A. Wolsey, Yves Pochet

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

zbMATH Keywords

valid inequalitieslot-sizing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items (51)

Decomposition and mean-field approach to mixed integer optimal compensation problems ⋮ Single item lot-sizing with non-decreasing capacities ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ A cutting plane approach to capacitated lot-sizing with start-up costs ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Source sink flows with capacity installation in batches ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Progress with single-item lot-sizing ⋮ New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem ⋮ Relaxations for two-level multi-item lot-sizing problems ⋮ Stronger upper and lower bounds for a hard batching problem to feed assembly lines ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A polyhedral study of lot-sizing with supplier selection ⋮ Approximation algorithms for supply chain planning and logistics problems with market choice ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Modeling industrial lot sizing problems: a review ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ Lot sizing with minimum order quantity ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Capacitated lot sizing problems with inventory bounds ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ Algorithms and extended formulations for one and two facility network design ⋮ 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 ⋮ Mixing MIR inequalities with two divisible coefficients ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Cutting planes in integer and mixed integer programming ⋮ Lot-sizing with production and delivery time windows ⋮ Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity ⋮ On formulations of the stochastic uncapacitated lot-sizing problem ⋮ Single‐warehouse multi‐retailer inventory systems with full truckload shipments ⋮ Convex hull results for generalizations of the constant capacity single node flow set ⋮ Capacitated lot-sizing problem with outsourcing ⋮ Polynomial cases of the economic lot sizing problem with cost discounts ⋮ Polyhedra for lot-sizing with Wagner-Whitin costs ⋮ Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation ⋮ A maritime inventory routing problem: Discrete time formulations and valid inequalities ⋮ Multi-item lot-sizing with joint set-up costs ⋮ Minimising bins in transmission systems ⋮ Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities ⋮ Dynamic coordination games with activation costs ⋮ Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs ⋮ Scheduling two chains of unit jobs on one machine: A polyhedral study ⋮ On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra ⋮ A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem ⋮ The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases

This page was built for publication: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities