Hybrid particle swarm optimization algorithm for cost minimization in service-workflows with due dates

Tongxin Xuebao/Journal on Communications

Volumn 29, Issue 8, 2008, Pages

  Zhang, Xiao Dong ^a,b   Li, Xiao Ping ^a,b   Wang, Qian ^a,b   Yuan, Ying Chun ^a,c  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

^c AGRICULTURAL UNIVERSITY OF HEBEI   (China)

Author keywords

Directed acrylic graph; Particle swarm optimization; Service workflow

Indexed keywords

DIRECTED ACRYLIC GRAPH; DUE DATES; PARTICLE SWARM OPTIMIZATION; SERVICE-WORKFLOW;

BOOLEAN FUNCTIONS; EVOLUTIONARY ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO);

OPTIMIZATION;

EID: 51749093113     PISSN: 1000436X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Foster I, Kesselman C. The Grid: Blueprint for a Future Computing Infrastructure [M]. USA: Morgan Kaufmann Publishers, 1999.
2. Foster I, Kesselman C, Nick J M, et al. Grid service for distributed system integration [J]. IEEE Computer, 2002, 35(6): 37-46.
3. Yu J, Buyya R. Taxonomy of scientific workflow systems for grid computing [J]. SIGMOD RECORD, 2005, 34 (3): 44-49.
4. Blythe J, Jain S, Deelman E, et al. Task scheduling strategies for workflow-based applications in grids [A]. IEEE International Symposium on Cluster Computing and Grid, Cardiff, Wales [C]. UK, 2005. 759-767.
5. De P, Dunne E J, Ghosh J B, et al. The discrete time-cost tradeoff problem revisited [J]. European Journal of Operational Research, 1995, 81(2): 225-238.
6. Demeulemeester E, Herroelen W, Elmaghraby S E. Optimal procedures for the discrete time/cost trade-off problem in project networks [J]. European Journal of Operational Research, 1996, 88(1): 50-68.
7. De P, Dunne E J, Ghosh J B, et al. Complexity of the discrete time-cost tradeoff problem for project networks [J]. Operations Research, 1997, 45(2): 302-306.
8. Buyya R, Abramson D, Giddy J, et al. Economic models for resource management and scheduling in grid computing [J]. Concurrency and Computation: Practice and Experience Journal (Special Issue on Grid Computing Environments), 2002, 14 (13-15): 1507-1542.
9. Abramson D, Buyya R, Giddy J. A computational economy for grid computing and its implementation in me nimrod-G resource broker [J]. Future Generation Computer Systems (FGCS) Journal, 2002, 18(8): 1061-1074.
10. Lin M, Lin Z X. A cost-effective critical path approach for service priority selections in grid computing economy [J]. Decision Support Systems, 2006, 42(3): 1628-1640.
11. Yu J, Buyya R, Tham C K. Cost-based scheduling of workflow applications on utility grids [A]. Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing [C]. Melbourne, Australia, 2005.
12. Yuan Y C, Li X P, Wang Q. Bottom level based heuristic for scheduling workflows in Grids[J]. Chinese Journal of Computers, 2008, 31(2): 282-290.
13. Yuan Y C, Li X P, Wang Q. Cost optimization for scheduling grid workflows based on serial reduction [J]. Journal of Computer Research and Development, 2008, 45(2): 246-253.
14. Kennedy J, Eberhart R. Particle swarm optimization [A]. Proc IEEE Int Conf on Neural Networks[C]. 1995. 1942-1948.
15. Eberhart R, Kennedy J. A new optimizer using particle swarm theory [A]. Proc 6th Int. Symposium on Micro Machine and Human Science [C]. 1995. 39-43.
16. Pan Q K, et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J]. Computers and Operations Research, 2008, 35(9): 2807-2839.
17. Hu W, Li Z S. A simpler and more effective particle swarm optimization algorithm [J]. Journal of Software, 2007, 18(4): 861-868.