Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

DOI10.1016/j.cor.2021.105373OpenAlexW3160890116MaRDI QIDQ2669493

Mehdi Bijari, Yaser Malekian, S. Hamid Mirmohammadi

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105373

zbMATH Keywords

capacitated lot sizing problemimplicit enumeration algorithmall-units quantity discountpolynomial exact algorithm

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Single-item lot-sizing with quantity discount and bounded inventory ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs

Cites Work

• Pricing for production and delivery flexibility in single-item lot-sizing
• The stochastic lot sizing problem with piecewise linear concave ordering costs
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
• An efficient optimal algorithm for the quantity discount problem in material requirement planning
• The stochastic lot-sizing problem with quantity discounts
• Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem
• Stochastic lot sizing problem with nervousness considerations
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs
• A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
• Pricing and production lot-size/scheduling with finite capacity for a deteriorating item over a finite horizon
• A dynamic quantity discount lot size model with resales
• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
• Dynamic Version of the Economic Lot Size Model
• Lot Sizing with Piecewise Concave Production Costs
• Capacity Acquisition, Subcontracting, and Lot Sizing
• Dynamic lot sizing with all‐units discount and resales
• Economic lot sizing with constant capacities and concave inventory costs
• The dynamic lot size model with quantity discount
• On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• Deterministic Production Planning: Algorithms and Complexity
• 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
• The dynamic lot size model with quantity discount: Counterexamples and correction
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

This page was built for publication: Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount