Single-item lot-sizing with quantity discount and bounded inventory

DOI10.1016/j.orl.2021.11.002OpenAlexW3214336004MaRDI QIDQ2670451

George Karakostas, Douglas G. Down, Somayye Rostami, Stavros G. Kolliopoulos

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.11.002

zbMATH Keywords

lot-sizingquantity discountbounded inventory

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
• Single-item dynamic lot-sizing problems: an updated survey
• A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs
• Joint optimization of dynamic lot and warehouse sizing problems
• A note on ``The economic lot sizing problem with inventory bounds
• Economic lot sizing problem with inventory bounds
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
• Lot Sizing with Piecewise Concave Production Costs
• The dynamic lot size model with quantity discount
• Computational Complexity of the Capacitated Lot Size Problem
• Bounded Production and Inventory Models with Piecewise Concave Costs
• A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: Single-item lot-sizing with quantity discount and bounded inventory