Efficient approximation schemes for economic lot-sizing in continuous time

DOI10.1016/j.disopt.2016.02.001zbMath1387.90026OpenAlexW2291401071MaRDI QIDQ1751154

Claudio Telha, Mathieu Van Vyve

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.02.001

zbMATH Keywords

continuous timeapproximation schemelot-sizingeconomic order quantitysub-linear complexity

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Approximation algorithms (68W25)

Uses Software

• KELLEY

Cites Work

• Optimal solution of nonlinear equations
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Dynamic Version of the Economic Lot Size Model
• Sublinear Time Algorithms
• Optimal Locations on a Line Are Interleaved
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient approximation schemes for economic lot-sizing in continuous time