{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:21:51Z","timestamp":1743045711313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_10","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"140-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Jobs with Precedence Constraints to Minimize Peak Demand"],"prefix":"10.1007","author":[{"given":"Elliott","family":"Pryor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Mumey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Yaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00450-017-0343-x","volume":"33","author":"L Barth","year":"2017","unstructured":"Barth, L., Ludwig, N., Mengelkamp, E., Staudt, P.: A comprehensive modelling framework for demand side flexibility in smart grids. Comput. Sci. - Res. Dev. 33, 13\u201323 (2017). https:\/\/doi.org\/10.1007\/s00450-017-0343-x","journal-title":"Comput. Sci. - Res. Dev."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Barth, L., Wagner, D.: Shaving peaks by augmenting the dependency graph. In: Proceedings of the Tenth ACM International Conference on Future Energy Systems (e-Energy), pp. 181\u2013191 (2019)","DOI":"10.1145\/3307772.3328298"},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/17M116032X","volume":"47","author":"L Chen","year":"2018","unstructured":"Chen, L., Megow, N., Schewior, K.: An $$\\cal{O}(\\log {m})$$-competitive algorithm for online machine minimization. SIAM J. Comput. 47(6), 2057\u20132077 (2018)","journal-title":"SIAM J. Comput."},{"key":"10_CR4","unstructured":"Chuzhoy, J., Guha, S., Khanna, S., Naor, J.S.: Machine minimization for scheduling jobs with interval constraints. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 81\u201390 (2004)"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3390\/en10010105","volume":"10","author":"Y Hong","year":"2017","unstructured":"Hong, Y., Wang, S., Huang, Z.: Efficient energy consumption scheduling: towards effective load leveling. Energies 10(1), 105 (2017)","journal-title":"Energies"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s12667-013-0114-0","volume":"5","author":"N Jewell","year":"2013","unstructured":"Jewell, N., Bai, L., Naber, J., McIntyre, M.L.: Analysis of electric vehicle charge scheduling and effects on electricity demand costs. Energy Syst. 5(4), 767\u2013786 (2013). https:\/\/doi.org\/10.1007\/s12667-013-0114-0","journal-title":"Energy Syst."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ludwig, N., Barth, L., Wagner, D., Hagenmeyer, V.: Industrial demand-side flexibility: a benchmark data set. In: Proceedings of the Tenth ACM International Conference on Future Energy Systems (e-Energy), pp. 460\u2013473 (2019)","DOI":"10.1145\/3307772.3331021"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"2910","DOI":"10.1109\/TSG.2014.2336261","volume":"5","author":"MK Petersen","year":"2014","unstructured":"Petersen, M.K., Hansen, L.H., Bendtsen, J., Edlund, K., Stoustrup, J.: Heuristic optimization for the discrete virtual power plant dispatch problem. IEEE Trans. Smart Grid 5(6), 2910\u20132918 (2014)","journal-title":"IEEE Trans. Smart Grid"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Ranjan, A., Khargonekar, P., Sahni, S.: Offline preemptive scheduling of power demands to minimize peak power in smart grids. In: 2014 IEEE Symposium on Computers and Communications (ISCC), pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/ISCC.2014.6912525"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Sou, K.C., Weimer, J., Sandberg, H., Johansson, K.H.: Scheduling smart home appliances using mixed integer linear programming. In: 50th IEEE Conference on Decision and Control and European Control Conference, pp. 5144\u20135149 (2011)","DOI":"10.1109\/CDC.2011.6161081"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Tang, S., Huang, Q., Li, X., Wu, D.: Smoothing the energy consumption: peak demand reduction in smart grid. In: 2013 Proceedings IEEE INFOCOM, pp. 1133\u20131141 (2013)","DOI":"10.1109\/INFCOM.2013.6566904"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10898-017-0524-y","volume":"69","author":"S Tang","year":"2017","unstructured":"Tang, S., Yuan, J., Zhang, Z., Du, D.Z.: iGreen: green scheduling for peak demand minimization. J. Glob. Optim. 69(1), 45\u201367 (2017)","journal-title":"J. Glob. Optim."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Yaw, S., Mumey, B., McDonald, E., Lemke, J.: Peak demand scheduling in the smart grid. In: 2014 IEEE International Conference on Smart Grid Communications (SmartGridComm), pp. 770\u2013775 (2014)","DOI":"10.1109\/SmartGridComm.2014.7007741"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-12691-3_1","volume-title":"Combinatorial Optimization and Applications","author":"S Yaw","year":"2014","unstructured":"Yaw, S., Mumey, B.: An exact algorithm for non-preemptive peak demand job scheduling. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 3\u201312. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12691-3_1"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.3390\/a10040122","volume":"10","author":"S Yaw","year":"2017","unstructured":"Yaw, S., Mumey, B.: Scheduling non-preemptible jobs to minimize peak demand. Algorithms 10(4), 122 (2017)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:46:37Z","timestamp":1607100397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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 (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}