Dynamic Programming for solving lot sizing with varying cost

Version 2.1.0 (3,5 KB) von Warut Boonphakdee
Varying cost - holding cost, ordering cost, raw material price
0.0
(0)
79 Downloads
Aktualisiert 9. Apr 2020

Lizenz anzeigen

Solving lot sizing problem with dynamic programming based on the shortest path of network flow. Holding cost, ordering cost and raw material cost are variable. The special characteristic of this algorithm run on problem with zero demand, while Wagner-Whitin algorithm does not certainly compute.

Zitieren als

Warut Boonphakdee (2024). Dynamic Programming for solving lot sizing with varying cost (https://www.mathworks.com/matlabcentral/fileexchange/74528-dynamic-programming-for-solving-lot-sizing-with-varying-cost), MATLAB Central File Exchange. Abgerufen .

Kompatibilität der MATLAB-Version
Erstellt mit R2019b
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Tags Tags hinzufügen

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Veröffentlicht Versionshinweise
2.1.0

Add how to put data in this code and explain the solution mation
2.0.0

When demand to be zeros , this algorithm can be effectively solved

1.0.0