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 independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m P S...Scheduling n independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m P S K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.展开更多
文摘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 independent tasks on m multiprocessors to minimize the total tardiness is a fundamental problem of deterministic scheduling theory. Bearing in mind this class of scheduling problem, a genetics based m P S K algorithm is proposed and an example is used to verify the high efficiency and stability of this algorithm.
