Relaxations for two-level multi-item lot-sizing problems
This article considers the generalized lot-sizing problem in combinatorial optimization. The article begins with a detailed overview of the existing literature and solution approaches to the classic lot-sizing problem including mixed integer formulations, before moving to problem extensions involving multiple levels, dependent demands and multiple items or clients. The focus of the research is to study the polyhedral structure of the optimization problem with a view to derive a strong formulation with valid inequalities which produce an efficient solution strategy. The optimization results are validated computationally on generated problem instances.
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A polyhedral study of multiechelon lot sizing with intermediate demands
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Approximate extended formulations
- Computational Complexity of the Capacitated Lot Size Problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic version of the economic lot size model
- Economic Lot-Sizing for Integrated Production and Transportation
- Graph Theory and Integer Programming
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- Improved Algorithms for Economic Lot Size Problems
- Integrated lot sizing in serial supply chains with production capacities
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Mixing mixed-integer inequalities
- Network Formulations of Mixed-Integer Programs
- On the convex hull of the union of certain polyhedra
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Packing and covering a tree by subtrees
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Production Planning by Mixed Integer Programming
- Single item lot-sizing with non-decreasing capacities
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Uncapacitated lot sizing with backlogging: the convex hull
- Uncapacitated lot-sizing with buying, sales and backlogging
- Uncapacitated lot-sizing: The convex hull of solutions
- Uncapacitated two-level lot-sizing
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- 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
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Algorithms for the two-stage production-capacitated lot-sizing problem
- A polyhedral study of multiechelon lot sizing with intermediate demands
- On the polyhedral structure of two-level lot-sizing problems with supplier selection
- Predictive search for capacitated multi-item lot sizing problems
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Integration of sales and operations: a dynamic mixed-integer programming game
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- Uncapacitated two-level lot-sizing
This page was built for publication: Relaxations for two-level multi-item lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403668)
