{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:36:32Z","timestamp":1743125792129,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030150921"},{"type":"electronic","value":"9783030150938"}],"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-15093-8_13","type":"book-chapter","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T13:07:46Z","timestamp":1552568866000},"page":"182-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing"],"prefix":"10.1007","author":[{"given":"Jixian","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ning","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,15]]},"reference":[{"key":"13_CR1","unstructured":"Amazon: Amazon ec2 instance types. \n                      https:\/\/amazonaws-china.com\/cn\/ec2\/instance-types\/"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.cor.2014.06.002","volume":"51","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Bianchessi, N., Filippi, C.: Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51(3), 268\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"29","key":"13_CR3","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E Angelelli","year":"2011","unstructured":"Angelelli, E., Filippi, C.: On the complexity of interval scheduling with a resource constraint. Theoret. Comput. Sci. 412(29), 3650\u20133657 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","unstructured":"ASCI: Grid workloads archives. \n                      http:\/\/gwa.ewi.tudelft.nl"},{"issue":"49","key":"13_CR5","doi-asserted-by":"publisher","first-page":"4217","DOI":"10.1016\/j.tcs.2010.08.028","volume":"411","author":"A Darmann","year":"2010","unstructured":"Darmann, A., Pferschy, U., Schauer, J.: Resource allocation with time intervals. Theoret. Comput. Sci. 411(49), 4217\u20134234 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. \n                      https:\/\/doi.org\/10.1109\/tpds.2017.2785815","DOI":"10.1109\/tpds.2017.2785815"},{"issue":"7","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1109\/TC.2015.2479598","volume":"65","author":"L Mashayekhy","year":"2016","unstructured":"Mashayekhy, L., Fisher, N., Grosu, D.: Truthful mechanisms for competitive reward-based scheduling. IEEE Trans. Comput. 65(7), 2299\u20132312 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2014.2355228","volume":"26","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy, L., Nejad, M.M., Grosu, D.: A PTAS mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans. Parallel Distrib. Syst. 26(9), 2386\u20132399 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"MM Nejad","year":"2015","unstructured":"Nejad, M.M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans. Parallel Distrib. Syst. 26(2), 594\u2013603 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"2060","DOI":"10.1109\/TNET.2015.2444657","volume":"24","author":"W Shi","year":"2016","unstructured":"Shi, W., Zhang, L., Wu, C., Li, Z., Lau, F.C.M.: An online auction framework for dynamic resource provisioning in cloud computing. IEEE\/ACM Trans. Networking 24(4), 2060\u20132073 (2016)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jpdc.2012.12.006","volume":"73","author":"S Zaman","year":"2013","unstructured":"Zaman, S., Grosu, D.: Combinatorial auction-based allocation of virtual machine instances in clouds. J. Parallel Distrib. Comput. 73(4), 495\u2013508 (2013)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15093-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:34:10Z","timestamp":1558341250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15093-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030150921","9783030150938"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15093-8_13","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":"15 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Green, Pervasive, and Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"11 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gpc2018","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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":"2.50","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.51","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}