Leaving aside the particular operating conditions of either method; a theoretical comparison of time by solution method, indicates that the 77 milliseconds SISCORMAD employed are significantly lower than those obtained with dynamic programming 320 milliseconds, 890 milliseconds with total enumeration, and 140 milliseconds obtained with geometric heuristic as solution times reported by [6]. This feature makes the developed algorithm very attractive for future applications. However, given the heuristic nature SISCORMAD, it is just a high quality solution, but not optimal.