commit 07d7a4a52c5261e73e3971500abc9f0ddcc0d96b
parent db71fccf2235f6765e035d7129987367fafc3c2f
Author: Bob Haugen <bob.haugen@gmail.com>
Date: Sat, 29 Feb 2020 09:44:22 -0600
Update dependent-demand.md
fix dependent demand doc link
Diffstat:
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/docs/appendix/dependent-demand.md b/docs/appendix/dependent-demand.md
@@ -2,7 +2,7 @@
Dependent demand is one popular planning and scheduling algorithm for economic networks. It is used in Material Requirements Planning (MRP), for example. The algorithm traverses recipes to create schedules for economic processes.
-Here is a long description of [Dependent Demand](http://hillside.net/plop/plop97/Proceedings/haugen.pdf). Below is a short version.
+Here is a long description of [Dependent Demand](http://mikorizal.org/dependent_demand.pdf). Below is a short version.
Basically, you traverse a graph of Recipe Processes backwards from the last Recipe Output, connecting Recipe Inputs with Recipe Outputs that have matching Resource Categories, and backscheduling all the processes and resource requirements based on estimated process durations. See [Graph search algorithms](http://jasonpark.me/AlgorithmVisualizer/).
