{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:53:16Z","timestamp":1770990796090,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031439421","type":"print"},{"value":"9783031439438","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43943-8_9","type":"book-chapter","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:52:25Z","timestamp":1694699545000},"page":"173-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scaling Optimal Allocation of\u00a0Cloud Resources Using Lagrange Relaxation"],"prefix":"10.1007","author":[{"given":"Luis","family":"de la Torre","sequence":"first","affiliation":[]},{"given":"Mahantesh","family":"Halappanavar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"9_CR1","unstructured":"Asner, D.M., Dart, E., Hara, T.: Belle II: experiment network and computing. Technical report arXiv:1308.0672. PNNL-SA-97204, August 2013. Contributed to CSS2013 (Snowmass)"},{"key":"9_CR2","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: Proceedings of the 21st Workshop on Job Scheduling Strategies for Parallel Processing (2015)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/2377677.2377719","volume":"42","author":"PX Gao","year":"2012","unstructured":"Gao, P.X., Curtis, A.R., Wong, B., Keshav, S.: It\u2019s not easy being green. ACM SIGCOMM Comput. Commun. Rev. 42(4), 211\u2013222 (2012)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"9_CR4","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(2), 287\u2013326 (1979)"},{"key":"9_CR5","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 \u201915, pp. 3:1\u20133:9. ACM, New York, NY, USA (2015)","DOI":"10.1145\/2822332.2822335"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Hara, T.: Belle II: computing and network requirements. In: Proceedings of the Asia-Pacific Advanced Network, pp. 115\u2013122 (2014)","DOI":"10.7125\/APAN.38.15"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jalgor.2005.01.003","volume":"59","author":"NJA Harvey","year":"2006","unstructured":"Harvey, N.J.A., Ladner, R.E., Lov\u00e1sz, L., Tamir, T.: Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1), 53\u201378 (2006)","journal-title":"J. Algorithms"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Juve, G., Deelman, E.: Scientific workflows and clouds. XRDS 16(3), 14\u201318 (2010). https:\/\/doi.org\/10.1145\/1734160.1734166","DOI":"10.1145\/1734160.1734166"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.simpat.2015.05.008","volume":"58","author":"B Kami\u0144ski","year":"2015","unstructured":"Kami\u0144ski, B., Szufel, P.: On optimization of simulation execution on amazon ec2 spot market. Simul. Model. Pract. Theory 58, 172\u2013187 (2015)","journal-title":"Simul. Model. Pract. Theory"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1504\/IJBIC.2014.060609","volume":"6","author":"R Mallipeddi","year":"2014","unstructured":"Mallipeddi, R., Suganthan, P.N.: Unit commitment - a survey and comparison of conventional and nature inspired algorithms. Int. J. Bio-Inspired Comput. 6(2), 71\u201390 (2014). https:\/\/doi.org\/10.1504\/IJBIC.2014.060609","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Roland, J., Figueira, J.R., De Smet, Y.: The inverse 0,1-knapsack problem: theory, algorithms and computational experiments. Discret. Optim. 10(2), 181\u2013192 (2013). https:\/\/doi.org\/10.1016\/j.disopt.2013.03.001, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1572528613000066","DOI":"10.1016\/j.disopt.2013.03.001"},{"issue":"2","key":"9_CR12","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.P.: A solution to the unit commitment problem\u2013a review. Front. Energy 7(2), 223\u2013236 (2013)","journal-title":"Front. Energy"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Schwartz, R., Dodge, J., Smith, N.A., Etzioni, O.: Green AI. Commun. ACM 63(12), 54\u201363 (2020). https:\/\/doi.org\/10.1145\/3381831","DOI":"10.1145\/3381831"},{"key":"9_CR14","unstructured":"Singer, G., Livenson, I., Dumas, M., Srirama, S.N., Norbisrath, U.: Towards a model for cloud computing cost estimation with reserved instances. In: Proceedings of 2nd International ICST Conference on Cloud Computing, CloudComp 2010 (2010)"},{"key":"9_CR15","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-12631-9_10","volume-title":"Recent Advances in Computational Optimization","author":"KM Tarplee","year":"2015","unstructured":"Tarplee, K.M., Friese, R., Maciejewski, A.A., Siegel, H.J.: Efficient and scalable pareto front generation for energy and makespan in heterogeneous computing systems. In: Fidanova, S. (ed.) Recent Advances in Computational Optimization. SCI, vol. 580, pp. 161\u2013180. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-12631-9_10"},{"key":"9_CR16","unstructured":"Wright, B.: A review of unit commitment. ELENE4511, 28 May 2013"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43943-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T13:53:36Z","timestamp":1694699616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43943-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439421","9783031439438"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43943-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 September 2023","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":"St. Petersburg, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - 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 (provided by the conference organizers)"}},{"value":"3.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}