I have a dependency graph of all tasks and costs for each task. Now I want to calculate scheduling for a given number of processors. I found a lot of documents on planning algorithms, optimal schedulers seem too expensive for my problem size (about 100 nodes), since this is an NP-hard problem. I would agree to a heuristic, preferably one that has a binding, how close it is to optimal. My problem is that I really have to code it myself? This had to be solved many times earlier, it can be easily applied to project management, is there something possible?
If you're familiar with a python library that would be perfect, and the next best thing would be C ++, otherwise I would agree to something else.
This is a fairly common problem. It also shows up in equipment design. There was a lot of work on algorithms to solve it.
If you are planning to write something, start by checking the "Hu algorithm."
, . . , , .
, , . , . - MIS II . Tcl, Python.