Task Hound
Task Hound — the backend scheduling system — will soon be open source.
What is Task Hound?
Since my professional career started in 1989, I always seem to be part of scheduling and resource-management efforts. No matter where I go and what I do. Even though I’m not a person that lives by any sort of schedule, I’ve always found it fascinating how to model planning, resource usage, and scheduling to help streamline processes for business and manufacturing.
Task Hound is finally at the point of being able to model just about any type of resource, condition, or task that uses the resource. I’ve gone from complex tree structures in C++ to a far more simplistic bit scheduler for horizon scheduling, and piece-wise linear chunks for vertical/quantity.
How it works today
The horizon scheduling is down to bit ANDs/ORs, so the storage need is very small and the speed is very fast. That’s how Task Hound schedules discrete resources. In an upcoming post I’ll show how variable capacity is handled.
I will start publishing how the scheduler works and will open-source Task Hound for everyone to use soon.
Have a correction or a different take?
I read every note and credit good ones in updates. It comes straight to me — nothing gets published automatically.
Send feedback