Multiechelon Lot Sizing: New Complexities and Inequalities
From MaRDI portal
Publication:5131474
DOI10.1287/opre.2019.1867zbMath1446.90048OpenAlexW3008404605MaRDI QIDQ5131474
No author found.
Publication date: 8 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1867
Related Items (3)
Subcontracting and lot-sizing with constant capacities ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms
Cites Work
- Unnamed Item
- Relaxations for two-level multi-item lot-sizing problems
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
- Uncapacitated two-level lot-sizing
- Uncapacitated lot sizing with backlogging: the convex hull
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- A study of the lot-sizing polytope
- Minimum concave cost flow over a grid network
- Dynamic Version of the Economic Lot Size Model
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Economic Lot-Sizing for Integrated Production and Transportation
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Uncapacitated lot-sizing: The convex hull of solutions
- Multitask and Multistage Production Planning and Scheduling for Process Industries
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Facilities in Series Inventory Model with Nested Schedules
- Mixing mixed-integer inequalities
This page was built for publication: Multiechelon Lot Sizing: New Complexities and Inequalities
