科研之友
微信
新浪微博
Facebook
分享链接
摘要
Grid workflow scheduling problem has been a research focus in grid computing in recent years. Various deterministic or meta-heuristic scheduling approaches have been proposed to solve this NP-complete problem. A perusal of published papers on the artificial immune system (AIS) reveals that most researchers use the clonal selection of B cells during the evolving processes and the affinity function of B cells to solve various optimisation problems. This research takes a different approach to the subject - firstly by applying a modified algorithm (Hu, T.C., 1961. Parallel sequencing and assembly line problem. Operations Research, 9 (6), 841-848) to sequence the job and this sequence is applied for further application. Secondly, the derived sequence is then used for machine allocations using the AIS approach. The proposed AIS apply B cells to reduce the antigens and then combining T helper cells and T suppressor cells to solve the grid scheduling problems. Our proposed methodology differs from other earlier approaches as follows: 1. A two-stage approach is applied using a fixed sequence derived from heuristic to allocate machine. 2. AIS apply B cells as bases and then T cells are employed next. T helper cells are used to help improve the solution and then T suppressor cells are generated to increase the diversity of the population. A new formula is proposed to calculate the affinity of the antibody with the antigen. The total difference of completion time of each job is applied instead of the difference of makespan of the schedule. This new AIS method can supplement the flaw of genetic algorithms (GA) using fitness as the basis and a new lifespan which will keep good diversified chromosomes within the population to extend the searching spaces. The experimental tests show that this novel AIS method is very effective when compared with other meta-heuristics such as GA, simulated annealing (SA), and ant colony optimisation (ACO).
- 出版日期2012
