Scheduling n independen tasks on m multiprocessors to minimize the makespan is a fundamental problem ofdeterministic scheduling theory. In the background of machine fault/restoration, a genetics based dynamic optimals...Scheduling n independen tasks on m multiprocessors to minimize the makespan is a fundamental problem ofdeterministic scheduling theory. In the background of machine fault/restoration, a genetics based dynamic optimalscleduling algorithm is presented in this paper and an example is given to verify the high efficiency and stability of thisalgorithm.展开更多
文摘Scheduling n independen tasks on m multiprocessors to minimize the makespan is a fundamental problem ofdeterministic scheduling theory. In the background of machine fault/restoration, a genetics based dynamic optimalscleduling algorithm is presented in this paper and an example is given to verify the high efficiency and stability of thisalgorithm.
