Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2011 (2011), Article ID 589862, 20 pages
http://dx.doi.org/10.1155/2011/589862
Research Article

Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid

Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, No. 35, Lane 215, Section 1, Chung-Shan Road, Taiping, Taichung 411, Taiwan

Received 13 October 2010; Revised 31 December 2010; Accepted 2 January 2011

Academic Editor: Nobuyuki Kenmochi

Copyright © 2011 Ruey-Maw Chen and Chuin-Mu Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. Foster, C. Kesselman, and S. Tuecke, “The anatomy of the grid: enabling scalable virtual organizations,” International Journal of High Performance Computing Applications, vol. 15, no. 3, pp. 200–222, 2001. View at Publisher · View at Google Scholar · View at Scopus
  2. T. Chen, B. Zhang, X. Hao, and Y. Dai, “Task scheduling in grid based on particle swarm optimization,” in Proceedings of the 5th International Symposium on Parallel and Distributed Computing (ISPDC '06), pp. 238–245, July 2006. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Salman, I. Ahmad, and S. Al-Madani, “Particle swarm optimization for task assignment problem,” Microprocessors and Microsystems, vol. 26, no. 8, pp. 363–371, 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Aggarwal, R. D. Kent, and A. Ngom, “Genetic algorithm based scheduler for computational grids,” in Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (HPCS '05), pp. 209–215, May 2005. View at Scopus
  5. G. Malewicz, A. L. Rosenberg, and M. Yurkewych, “On scheduling complex dags for internet-based computing,” in Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS '05), April 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. L. He, S. A. Jarvis, D. P. Spooner, D. Bacigalupo, G. Tan, and G. R. Nudd, “Mapping DAG-based applications to multiclusters with background workload,” in Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, pp. 855–862, May 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. G. T. Ross and R. M. Soland, “A branch and bound algorithm for the generalized assignment problem,” Mathematical Programming, vol. 8, pp. 91–103, 1975. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. R. M. Chen, S. T. Lo, and Y. M. Huang, “Combining competitive scheme with slack neurons to solve real-time job scheduling problem,” Expert Systems with Applications, vol. 33, no. 1, pp. 75–85, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. F. E. Sandnes, “Secure distributed configuration management with randomised scheduling of system-administration tasks,” IEICE Transactions on Information and Systems, vol. E86-D, no. 9, pp. 1601–1610, 2003. View at Google Scholar · View at Scopus
  10. M. Basu, “Hybridization of artificial immune systems and sequential quadratic programming for dynamic economic dispatch,” Electric Power Components and Systems, vol. 37, no. 9, pp. 1036–1045, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. J. H. Holland, “Genetic algorithms and classifier systems: foundations and future directions,” in Proceedings of the 2nd International Conference on Genetic Algorithms and Their Application, 1987.
  12. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Google Scholar
  13. F. Glover, “Tabu search—part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, 1989. View at Google Scholar
  14. F. Glover, “Tabu search—part II,” ORSA Journal on Computing, vol. 2, no. 1, pp. 4–32, 1990. View at Google Scholar
  15. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Google Scholar · View at Scopus
  16. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the 4th IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at Scopus
  17. J. Oh and C. Wu, “Genetic-algorithm-based real-time task scheduling with multiple goals,” Journal of Systems and Software, vol. 71, no. 3, pp. 245–258, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. Z. Liu and H. Wang, “GA-based resource-constrained project scheduling with the objective of minimizing activities’ cost,” in Proceedings of the International Conference on Intelligent Computing (ICIC '05), vol. 3644 of Lecture Notes in Computer Science, pp. 937–946, August 2005. View at Scopus
  19. N. Amjady and A. Shirzadi, “Unit commitment using a new integer coded genetic algorithm,” European Transactions on Electrical Power, vol. 19, no. 8, pp. 1161–1176, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. O. Sinnen, L. A. Sousa, and F. E. Sandnes, “Toward a realistic task scheduling model,” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 3, pp. 263–275, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. K. Bouleimen and H. Lecocq, “A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version,” European Journal of Operational Research, vol. 149, no. 2, pp. 268–281, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. K. H. Kim and K. C. Moon, “Berth scheduling by simulated annealing,” Transportation Research B, vol. 37, no. 6, pp. 541–560, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. G. Wan and B. P.-C. Yen, “Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties,” European Journal of Operational Research, vol. 142, no. 2, pp. 271–281, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  24. S. G. Ponnambalam, P. Aravindan, and S. V. Rajesh, “Tabu search algorithm for job shop scheduling,” International Journal of Advanced Manufacturing Technology, vol. 16, no. 10, pp. 765–771, 2000. View at Publisher · View at Google Scholar · View at Scopus
  25. S. T. Lo, R. M. Chen, Y. M. Huang, and C. L. Wu, “Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system,” Expert Systems with Applications, vol. 34, no. 3, pp. 2071–2081, 2008. View at Publisher · View at Google Scholar · View at Scopus
  26. W. J. Gutjahr and M. S. Rauner, “An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria,” Computers and Operations Research, vol. 34, no. 3, pp. 642–666, 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. F. Zhao, Y. Hong, D. Yu, Y. Yang, and Q. Zhang, “A hybrid particle swarm optimisation algorithm and fuzzy logic for process planning and production scheduling integration in holonic manufacturing systems,” International Journal of Computer Integrated Manufacturing, vol. 23, no. 1, pp. 20–39, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. T. L. Lin, S. J. Horng, T. W. Kao et al., “An efficient job-shop scheduling algorithm based on particle swarm optimization,” Expert Systems with Applications, vol. 37, no. 3, pp. 2629–2636, 2010. View at Publisher · View at Google Scholar · View at Scopus
  29. H. Liu, A. Abraham, and Z. Wang, “A multi-swarm approach to multi-objective flexible job-shop scheduling problems,” Fundamenta Informaticae, vol. 95, no. 4, pp. 465–489, 2009. View at Google Scholar
  30. R. M. Chen, C. L. Wu, C. M. Wang, and S. T. Lo, “Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB,” Expert Systems with Applications, vol. 37, no. 3, pp. 1899–1910, 2010. View at Publisher · View at Google Scholar · View at Scopus
  31. C. Chiu, M. J. J. Wu, Y. T. Tsai, N. H. Chiu, M. S. H. Ho, and H. J. Shyu, “Constrain-based particle swarm optimization (CBPSO) for call center scheduling,” International Journal of Innovative Computing, Information and Control, vol. 5, no. 12, pp. 4541–4549, 2009. View at Google Scholar · View at Scopus
  32. M. F. Tasgetiren, Y. C. Liang, M. Sevkli, and G. Gencyilmaz, “A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 1930–1947, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. J. Behnamian, M. Zandieh, and S. M. T. Fatemi Ghomi, “Due windows group scheduling using an effective hybrid optimization approach,” International Journal of Advanced Manufacturing Technology, vol. 46, no. 5–8, pp. 721–735, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. Y. Hei, X. Li, K. Yi, and H. Yang, “Novel scheduling strategy for downlink multiuser MIMO system: particle swarm optimization,” Science in China F, vol. 52, no. 12, pp. 2279–2289, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  35. M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar · View at Scopus
  36. S. Hartmann, “Project scheduling with multiple modes: a genetic algorithm,” Annals of Operations Research, vol. 102, no. 1, pp. 111–135, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  37. F. F. Boctor, “Heuristics for scheduling projects with resource restrictions and several resource-duration modes,” International Journal of Production Research, vol. 31, no. 11, pp. 2547–2558, 1993. View at Google Scholar · View at Scopus
  38. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at Google Scholar · View at Scopus
  39. D. Bratton and J. Kennedy, “Defining a standard for particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '07), pp. 120–127, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  40. D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Google Scholar · View at Scopus
  41. J. N. Lin and H. Z. Wu, “Scheduling in grid computing environment based on genetic algorithm,” Journal of Computer Research and Development, vol. 41, no. 12, pp. 2195–2199, 2004 (Chinese). View at Google Scholar · View at Scopus
  42. Project Scheduling Problem Library, PSPLIB, http://129.187.106.231/psplib/.
  43. W. Herroelen, B. De Reyck, and E. Demeulemeester, “Resource-constrained project scheduling: a survey of recent developments,” Computers & Operations Research, vol. 25, no. 4, pp. 279–302, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  44. B. Jarboui, N. Damak, P. Siarry, and A. Rebai, “A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems,” Applied Mathematics and Computation, vol. 195, no. 1, pp. 299–308, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  45. J. Alcaraz, C. Maroto, and R. Ruiz, “Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms,” Journal of the Operational Research Society, vol. 54, no. 6, pp. 614–626, 2003. View at Publisher · View at Google Scholar · View at Scopus
  46. J. Józefowska, M. Mika, R. Różycki, G. Waligóra, and J. Węglarz, “Simulated annealing for multi-mode resource-constrained project scheduling,” Annals of Operations Research, vol. 102, no. 1–4, pp. 137–155, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  47. C. W. Chiang, Y. Q. Huang, and W. Y. Wang, “Ant colony optimization with parameter adaptation for multi-mode resource-constrained project scheduling,” Journal of Intelligent and Fuzzy Systems, vol. 19, no. 4-5, pp. 345–358, 2008. View at Google Scholar · View at Scopus
  48. S. Hartmann and A. Drexl, “Project scheduling with multiple modes: a comparison of exact algorithms,” Networks, vol. 32, no. 4, pp. 283–297, 1998. View at Google Scholar · View at Zentralblatt MATH