The stochastic lot-sizing problem with quantity discounts

DOI10.1016/j.cor.2016.11.014zbMath1391.90014OpenAlexW2553764261MaRDI QIDQ1652181

Wen Jiao, Hong Yan, Ju-liang Zhang

Publication date: 11 July 2018

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

Full work available at URL: https://dspace.lboro.ac.uk/2134/26456

zbMATH Keywords

inventorypolynomial time algorithmall-unit quantity discountsstochastic lot-sizing problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (4)

A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation ⋮ An optimal setup cost reduction and lot size for economic production quantity model with imperfect quality and quantity discounts

Cites Work

• Unnamed Item
• Linear programming models for a stochastic dynamic capacitated lot sizing problem
• The stochastic lot sizing problem with piecewise linear concave ordering costs
• Stochastic lot-sizing with backlogging: computational complexity analysis
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• On stochastic lot-sizing problems with random lead times
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
• An efficient optimal algorithm for the quantity discount problem in material requirement planning
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
• A dynamic quantity discount lot size model with resales
• Single item lot sizing problems
• Dynamic Version of the Economic Lot Size Model
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• Quantity Discounts Under Demand Uncertainty
• A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
• The dynamic lot size model with quantity discount
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• 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
• The dynamic lot size model with quantity discount: Counterexamples and correction
• An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
• Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions
• On the Optimality of Generalized (s, S) Policies
• The Optimality of Generalized (s, S) Policies under Uniform Demand Densities

This page was built for publication: The stochastic lot-sizing problem with quantity discounts