Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions-Reference-Cited by-同舟云学术

Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions

Published:1994-06 Issue:2 Volume:75 Page:312-331
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

van Hoesel Stan,Wagelmans Albert,Moerman Bram

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference24 articles.

1. Improved algorithms for economic lot-size problems;Aggarwal;Operations Research,1993

2. Data Structures and Algorithms;Aho,1983

3. A dynamic lot sizing model with learning in setups;Chand;Operations Research,1990

4. Dynamic Programming: Models and Applications;Denardo,1982

5. An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing;Evans;Journal of Operations Management,1985

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sum-of-Max partition under a Knapsack constraint;Computers and Electrical Engineering;2023-01

2. Combined replenishment and warehousing with contract commitments and flexibilities;Naval Research Logistics (NRL);2021-08-02

3. An improved algorithm for the lot-sizing problem with outbound shipment;Omega;2021-04

4. Subcontracting and lot-sizing with constant capacities;Mathematical Programming;2021-01-08

5. Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review;Computers & Industrial Engineering;2020-11