Develop algorithm for deterministic scheduling problems subsidiaries and divisible tasks on a single processor to minimize the maximum delay AND scheduling subsidiaries (antytree graph) and indivisible (unit) tasks on any number of processors to minimize the maximum delay.
App in C++ with simple gui for input data and generate Gantt charts.
Bu iş için 7 freelancer ortalamada $263 teklif veriyor
Hi, I am a graduate in CSE with major in Algorithms and Data Structures . I assure you of simple, clean, efficient code with proper comment and documentation. Ready to start now. Regards, Rakib
Hello, sir. I would love to work for you. Thank you very much.
I am very good at algorithms,this problem is a kind of weighted bipartite graph matching,which My thesis was related.I would very likely help you,but wihtout the GUI and Gantt charts, I will write the algorithm which Daha Fazla
please let me knows i am intrested in this project.