{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:07:48Z","timestamp":1726006068375},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030106317"},{"type":"electronic","value":"9783030106324"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10632-4_6","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T09:33:04Z","timestamp":1547285584000},"page":"107-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stochastic Programming Approach for Resource Selection Under Demand Uncertainty"],"prefix":"10.1007","author":[{"given":"Tanveer Hossain","family":"Bhuiyan","sequence":"first","affiliation":[]},{"given":"Mahantesh","family":"Halappanavar","sequence":"additional","affiliation":[]},{"given":"Ryan D.","family":"Friese","sequence":"additional","affiliation":[]},{"given":"Hugh","family":"Medal","sequence":"additional","affiliation":[]},{"given":"Luis","family":"de la Torre","sequence":"additional","affiliation":[]},{"given":"Arun","family":"Sathanur","sequence":"additional","affiliation":[]},{"given":"Nathan R.","family":"Tallent","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische mathematik 4(1), 238\u2013252 (1962)","journal-title":"Numerische mathematik"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bhuiyan, T.H., Nandi, A.K., Medal, H., Halappanavar, M.: Minimizing expected maximum risk from cyber-attacks with probabilistic attack success. In: 2016 IEEE Symposium on Technologies for Homeland Security (HST), pp. 1\u20136. IEEE (2016)","DOI":"10.1109\/THS.2016.7568892"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming, 2nd edn. Springer Publishing Company, New York (2011). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-0237-4","edition":"2"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TSC.2011.7","volume":"5","author":"S Chaisiri","year":"2012","unstructured":"Chaisiri, S., Lee, B.S., Niyato, D.: Optimization of resource provisioning cost in cloud computing. IEEE Trans. Serv. Comput. 5(2), 164\u2013177 (2012)","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-77398-8_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"RD Friese","year":"2018","unstructured":"Friese, R.D., Halappanavar, M., Sathanur, A.V., Schram, M., Kerbyson, D.J., de la Torre, L.: Towards efficient resource allocation for distributed workflows under demand uncertainties. In: Klus\u00e1\u010dek, D., Cirne, W., Desai, N. (eds.) JSSPP 2017. LNCS, vol. 10773, pp. 103\u2013121. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77398-8_6"},{"key":"6_CR7","unstructured":"Gurobi, O.: Gurobi optimizer reference manual (2015). \nhttp:\/\/www.gurobi.com"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Halappanavar, M., Schram, M., de la Torre, L., Barker, K., Tallent, N.R., Kerbyson, D.J.: Towards efficient scheduling of data intensive high energy physics workflows. In: Proceedings of the 10th Workshop on Workflows in Support of Large-Scale Science, WORKS 2015, pp. 3:1\u20133:9. ACM, New York, USA (2015)","DOI":"10.1145\/2822332.2822335"},{"issue":"0","key":"6_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7125\/APAN.38.15","volume":"38","author":"Takanori Hara","year":"2014","unstructured":"Hara, T.: Belle II: Computing and network requirements. In: Proceedings of the Asia-Pacific Advanced Network, pp. 115\u2013122 (2014)","journal-title":"Proceedings of the Asia-Pacific Advanced Network"},{"key":"6_CR10","unstructured":"Huang, Z.C., He, C., Gu, L., Wu, J.F.: On-demand service in grid: architecture, design and implementation. In: 2005 Proceedings of 11th International Conference on Parallel and Distributed Systems, vol. 2, pp. 674\u2013678. IEEE (2005)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TPWRS.2008.919422","volume":"23","author":"P Jirutitijaroen","year":"2008","unstructured":"Jirutitijaroen, P., Singh, C.: Reliability constrained multi-area adequacy planning using stochastic programming with sample-average approximations. IEEE Trans. Power Syst. 23(2), 504\u2013513 (2008)","journal-title":"IEEE Trans. Power Syst."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Johannes, A., Borhan, N., Liu, C., Ranjan, R., Chen, J.: A user demand uncertainty based approach for cloud resource management. In: 2013 IEEE 16th International Conference on Computational Science and Engineering (CSE), pp. 566\u2013571. IEEE (2013)","DOI":"10.1109\/CSE.2013.90"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479\u2013502 (2002)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10586-007-0022-y","volume":"10","author":"D Kusic","year":"2007","unstructured":"Kusic, D., Kandasamy, N.: Risk-aware limited lookahead control for dynamic resource provisioning in enterprise computing systems. Cluster Comput. 10(4), 395\u2013408 (2007)","journal-title":"Cluster Comput."},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"WK Mak","year":"1999","unstructured":"Mak, W.K., Morton, D.P., Wood, R.K.: Monte carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1), 47\u201356 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejor.2011.10.029","volume":"218","author":"E Medernach","year":"2012","unstructured":"Medernach, E., Sanlaville, E.: Fair resource allocation for different scenarios of demands. Eur. J. Oper. Res. 218(2), 339\u2013350 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TCC.2014.2314655","volume":"2","author":"MA Rodriguez","year":"2014","unstructured":"Rodriguez, M.A., Buyya, R.: Deadline based resource provisioningand scheduling algorithm for scientific workflows on clouds. IEEE Trans. Cloud Comput. 2(2), 222\u2013235 (2014)","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1), 96\u2013115 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s11708-013-0240-3","volume":"7","author":"B Saravanan","year":"2013","unstructured":"Saravanan, B., Das, S., Sikri, S., Kothari, D.: A solution to the unit commitment problem-a review. Front. Energy 7(2), 223 (2013)","journal-title":"Front. Energy"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01580086","volume":"81","author":"A Shapiro","year":"1998","unstructured":"Shapiro, A., Homem-de Mello, T.: A simulation-based approach to two-stage stochastic programming with recourse. Math. Program. 81(3), 301\u2013325 (1998)","journal-title":"Math. Program."},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Slyke Van","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4), 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Yang, J., Qiu, J., Li, Y.: A profile-based approach to just-in-time scalability for cloud applications. In: 2009 IEEE International Conference on Cloud Computing, CLOUD 2009, pp. 9\u201316. IEEE (2009)","DOI":"10.1109\/CLOUD.2009.87"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Zhu, Q., Boutaba, R.: Dynamic resource allocation for spot markets in cloud computing environments. In: 2011 Fourth IEEE International Conference on Utility and Cloud Computing (UCC), pp. 178\u2013185. IEEE (2011)","DOI":"10.1109\/UCC.2011.33"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10479-012-1092-7","volume":"210","author":"QP Zheng","year":"2013","unstructured":"Zheng, Q.P., Wang, J., Pardalos, P.M., Guan, Y.: A decomposition approach to the two-stage stochastic unit commitment problem. Annal. Oper. Res. 210(1), 387\u2013410 (2013)","journal-title":"Annal. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10632-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T09:39:41Z","timestamp":1547285981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10632-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030106317","9783030106324"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10632-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Job Scheduling Strategies for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/jsspp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}