A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Research in Computing Science
Resource constrained project scheduling problems have a computational complexity that makes it difficult to obtain optimal solutions using exact methods. Thus, heuristic techniques have been used to generate feasible solutions in acceptable computational times. In this paper, we analyse static population topologies for an algorithm based on the Method of Musical Composition (MMC) to solve the problem of course scheduling in a university in a minimum number of quarters. We show that the socialdoi:10.13053/rcs-68-1-6 fatcat:evtfqehe3jgflb4rnere3v42gm