Discussion of “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II”
I would like to congratulate Dr. Fisher on the quality of his research paper. This research shows much promise for advancing the resource scheduling problem from one for which only theoretical solution procedures exist to one which can be solved in practice. Branch and bound algorithms appear to present the greatest hope in the near term for obtaining practical solutions to research scheduling problems. Hence the branch and bound algorithms presented in Part II of Dr. Fisher’s paper coupled with and complimenting the bounding procedures presented in Part I appear to represent a significant improvement over existing methods of solving resource scheduling problems.
Unable to display preview. Download preview PDF.