In several publications on Cilk++ and Intel CIlk the writers use the term provably efficient scheduling algorithm. I am paraphrasing here.
Being an operations research professional I have done my fair share of mathematical proofs, but, frankly,I have never had a formal education in scheduling.
I do know that scheduling is an amazing complicated field of operations research and that there are few rigorousproofs in it. Each scheduling situation is unique and there are few proofs that can be applied to it; as compared to resource allocation in which we have a simplex algorithm which has beenrigorously proved.
If there is a formal proof please give me a reference or link, if there is a paper a reference or link will also work. I just want someone to expand on that phrase.
The people that I work for will surely want to know more about this.