Abstract
In the background of service resources optimizing management in cloud computing, a research on the time-window based non-identical parallel machine schedule problem was conducted. To get the most tasks done, minimizing delay time was chosen to be the objective of the mathematical model and an ant colony algorithm was given. Different parameters of this algorithm were designed and its feasibility and rationality were proved by a simulation example. The result indicates that the modified ant colony algorithm could be well applied in the parallel scheduling in cloud computing. It can be found that the optimal solution satisfied the constraint condition with a fast convergence rate.
| Original language | English |
|---|---|
| Pages (from-to) | 225-229 |
| Number of pages | 5 |
| Journal | Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) |
| Volume | 40 |
| Issue number | Suppl.1 |
| Publication status | Published - Dec 2012 |
| Externally published | Yes |
Keywords
- cloud computing
- parallel machine scheduling
- ant colony algorithm
- sensitivity analysis
- service resources