Approximation formulations for the single-product capacitated lot size problem

Authors:
Gabriel R Bitran;Hirofumi Matsuo
Affiliations:
-;-
Venue:
Operations Research
Year:
1986

Citing 0
Cited 4

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

Computers and Operations Research
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs

Computational Optimization and Applications
Applying genetic algorithms to dynamic lot sizing with batch ordering

Computers and Industrial Engineering
Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(NlogN) time

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract