Login / Signup
A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows.
Bertrand Hellion
Fabien Mangione
Bernard Penz
Published in:
Oper. Res. Lett. (2014)
Keyphrases
</>
lot sizing
single item
cost function
computational complexity
mixed integer programming
learning algorithm
wagner whitin
inventory systems
worst case
combinatorial auctions
lead time
probabilistic model
joint replenishment
mathematical model
planning horizon
bin packing
optimal solution
reinforcement learning