Subcontracting and lot-sizing with constant capacities
From MaRDI portal
Publication:2133416
DOI10.1007/s10107-020-01603-0zbMath1487.90115OpenAlexW3118410282MaRDI QIDQ2133416
Publication date: 29 April 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01603-0
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)
Cites Work
- Unnamed Item
- Geometric applications of a matrix-searching algorithm
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Single-item dynamic lot-sizing problems: an updated survey
- The single-item lot-sizing problem with immediate lost sales
- Economic lot sizing: the capacity reservation model
- Dynamic Version of the Economic Lot Size Model
- Capacity Acquisition, Subcontracting, and Lot Sizing
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- An O(T2) Algorithm for the NI/G/NI/ND 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
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- Integrated capacity, demand, and production planning with subcontracting and overtime options
This page was built for publication: Subcontracting and lot-sizing with constant capacities
