Bottom Level Based Heuristic for Workflow Scheduling in Grids: Bottom Level Based Heuristic for Workflow Scheduling in Grids

[1]  Zhangxi Lin,et al.  A cost-effective critical path approach for service priority selections in grid computing economy , 2006, Decis. Support Syst..

[2]  Can Akkan,et al.  Network decomposition-based benchmark results for the discrete time-cost tradeoff problem , 2005, Eur. J. Oper. Res..

[3]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[4]  Ismail Hakki Toroslu,et al.  An architecture for workflow scheduling under resource allocation constraints , 2005, Inf. Syst..

[5]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[6]  Adam Arbree,et al.  Mapping Abstract Complex Workflows onto Grid Environments , 2003, Journal of Grid Computing.

[7]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[8]  David Abramson,et al.  A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Brok , 2001, Future Gener. Comput. Syst..

[9]  S. Tuecke,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[10]  Prabuddha De,et al.  Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks , 1997, Oper. Res..

[11]  Prabuddha De,et al.  The discrete time-cost tradeoff problem revisited , 1995 .

[12]  Erik Demeulemeester,et al.  Optimal procedures for the discrete time/cost trade-off problem in project networks , 1996 .