{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:13:15Z","timestamp":1725570795004},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173578"},{"type":"electronic","value":"9783642173585"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45005-1_15","type":"book-chapter","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T04:53:14Z","timestamp":1385527994000},"page":"207-221","source":"Crossref","is-referenced-by-count":21,"title":["Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud Computing"],"prefix":"10.1007","author":[{"given":"Zhicheng","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xiaoping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jatinder N. D.","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/TPDS.2012.102","volume":"24","author":"K. Chard","year":"2013","unstructured":"Chard, K., Bubendorfer, K.: High performance resource allocation strategies for computational economies. IEEE Transactions on Parallel and Distributed Systems\u00a024(1), 72\u201384 (2013)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.K. Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR)\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/TPDS.2004.1264795","volume":"15","author":"R. Bajaj","year":"2004","unstructured":"Bajaj, R., Agrawal, D.P.: Improving scheduling of tasks in a heterogeneous environment. IEEE Transactions on Parallel and Distributed Systems\u00a015(2), 107\u2013118 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"6","key":"15_CR4","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.jpdc.2011.01.008","volume":"71","author":"E.K. Byun","year":"2011","unstructured":"Byun, E.K., Kee, Y.S., Kim, J.S., Deelman, E., Maeng, S.: Bts: Resource capacity estimate for time-targeted science workflows. Journal of Parallel and Distributed Computing\u00a071(6), 848\u2013862 (2011)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/opre.45.2.302","volume":"45","author":"P. De","year":"1997","unstructured":"De, P., Dunne, E., Ghosh, J., Wells, C.: Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research\u00a045(2), 302\u2013306 (1997)","journal-title":"Operations Research"},{"key":"15_CR6","unstructured":"Yu, J., Buyya, R., Tham, C.: Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing, p. 8. IEEE (2005)"},{"issue":"15","key":"15_CR7","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1016\/j.ins.2009.01.035","volume":"179","author":"Y. Yuan","year":"2009","unstructured":"Yuan, Y., Li, X., Wang, Q., Zhu, X.: Deadline division-based heuristic for cost optimization in workflow scheduling. Information Sciences\u00a0179(15), 2562\u20132575 (2009)","journal-title":"Information Sciences"},{"issue":"8","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TPDS.2011.303","volume":"23","author":"S. Abrishami","year":"2012","unstructured":"Abrishami, S., Naghibzadeh, M., Epema, D.: Cost-driven scheduling of grid workflows using partial critical paths. IEEE Transactions on Parallel and Distributed Systems\u00a023(8), 1400\u20131414 (2012)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"15_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1155\/2006\/271608","volume":"14","author":"J. Yu","year":"2006","unstructured":"Yu, J., Buyya, R.: Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Scientific Programming\u00a014(3), 217\u2013230 (2006)","journal-title":"Scientific Programming"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TSMCC.2008.2001722","volume":"39","author":"W.N. Chen","year":"2009","unstructured":"Chen, W.N., Zhang, J.: An ant colony optimization approach to a grid workflow scheduling problem with various qos requirements. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews\u00a039(1), 29\u201343 (2009)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s11227-011-0578-4","volume":"63","author":"Z. Wu","year":"2013","unstructured":"Wu, Z., Liu, X., Ni, Z., Yuan, D., Yang, Y.: A market-oriented hierarchical scheduling strategy in cloud workflow systems. The Journal of Supercomputing\u00a063(1), 256\u2013293 (2013)","journal-title":"The Journal of Supercomputing"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Abrishami, S., Naghibzadeh, M., Epema, D.: Deadline-constrained workflow scheduling algorithms for iaas clouds. In: Future Generation Computer Systems (2012)","DOI":"10.1016\/j.future.2012.05.004"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E. Demeulemeester","year":"2003","unstructured":"Demeulemeester, E., Vanhoucke, M., Herroelen, W.: Rangen: A random network generator for activity-on-the-node networks. Journal of Scheduling\u00a06(1), 17\u201338 (2003)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejor.2004.04.006","volume":"165","author":"C. Akkan","year":"2005","unstructured":"Akkan, C., Drexl, A., Kimms, A.: Network decomposition-based benchmark results for the discrete time\u2013cost tradeoff problem. European Journal of Operational Research\u00a0165(2), 339\u2013358 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science\u00a041(10), 1693\u20131703 (1995)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45005-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T17:44:17Z","timestamp":1558719857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45005-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642173578","9783642173585"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45005-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}