Indexed by:
Abstract:
To rind an optimal multi-machine scheduling for objective tasks with deadline constraints, an optimal model was proposed, and GASA hybrid optimal strategy was applied to solve this problem. Each individual has two gene clusters, one record the order of the tasks to be executed, the other stands for the number of the tasks allocated to each machine. Individuals created by greedy algorithm were introduced to improve adaptability of initial population, and simulated annealing algorithm was introduced to avoid prematurity. Several simulation experiments show that the proposed scheduling algorithm is valid and feasible.
Keyword:
Reprint Author's Address:
Email:
Source :
WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS
Year: 2006
Page: 3571-,
Language: Chinese
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: