A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
From MaRDI portal
Publication:3144405
DOI10.1287/opre.1120.1058zbMath1260.90031OpenAlexW2003062172MaRDI QIDQ3144405
Simge Küçükyavuz, Minjiao Zhang, Hande Yaman
Publication date: 7 December 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/21419
Related Items (21)
On reformulations for the one-warehouse multi-retailer problem ⋮ Subcontracting and lot-sizing with constant capacities ⋮ Algorithms for the two-stage production-capacitated lot-sizing problem ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ Relaxations for two-level multi-item lot-sizing problems ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ Two-level lot-sizing with inventory bounds ⋮ Capacitated lot-sizing problem with outsourcing ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Coordination of a two-level supply chain with contracts ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid ⋮ Minimum concave cost flow over a grid network
Uses Software
This page was built for publication: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
