Some new properties for capacitated lot-sizing problem with bounded inventory and stockouts

Authors:
Xiao Liu;Feng Chu;Chengbin Chu;Chengen Wang
Affiliations:
Laboratorie d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes Cedex, France and Shenyang Institute of Automation, Chinese Academy of Sciences, China;Laboratorie d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes Cedex, France;Laboratorie d'Optimisation des Systemes Industriels, Universite de Technologie de Troyes, Troyes Cedex, France;Shenyang Institute of Automation, Chinese Academy of Sciences, China
Venue:
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
Year:
2004

Citing 8
Cited 0

An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem

Management Science
A forward algorithm for the capacitated lot size model with stockout

Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Improved algorithms for economic lot size problems

Operations Research
Decision horizons for the capacitated lot size model with inventory bounds and stockouts

Computers and Operations Research
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs

Management Science
A new characterization for the dynamic lot size problem with bounded inventory

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formulate the single-item inventory capacitated lot size model with lost sales. Unsatisfied demand cannot be backlogged, which means lost sales. Costs are assumed to be time variant. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in O(T2) time.