Uncapacitated two-level lot-sizing
From MaRDI portal
Publication:991455
DOI10.1016/j.orl.2010.04.001zbMath1193.90091MaRDI QIDQ991455
Laurence A. Wolsey, Rafael A. Melo
Publication date: 7 September 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.001
Related Items
Multiechelon Lot Sizing: New Complexities and Inequalities, On reformulations for the one-warehouse multi-retailer problem, Algorithms for the two-stage production-capacitated lot-sizing problem, Relaxations for two-level multi-item lot-sizing problems, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem, Single-item dynamic lot-sizing problems: an updated survey, An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels, Two-level lot-sizing with inventory bounds, MIP formulations and heuristics for two-level production-transportation problems, Capacitated lot-sizing problem with outsourcing, A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
Cites Work
- Unnamed Item
- Unnamed Item
- Computational complexity of uncapacitated multi-echelon production planning problems
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Approximate extended formulations
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- Uncapacitated lot-sizing: The convex hull of solutions
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- 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
- 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