{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T22:17:13Z","timestamp":1780525033861,"version":"3.54.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031270505","type":"print"},{"value":"9783031270512","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-27051-2_26","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"305-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Interweaving Real-Time Jobs with\u00a0Energy Harvesting to\u00a0Maximize Throughput"],"prefix":"10.1007","author":[{"given":"Baruch","family":"Schieber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhargav","family":"Samineni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soroush","family":"Vahidi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"issue":"6","key":"26_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Sched. 2(6), 245\u2013252 (1999)","journal-title":"J. Sched."},{"key":"26_CR2","unstructured":"Boyer, S.A.: SCADA: Supervisory Control and Data Acquisition. International Society of Automation, 4th edition (2010)"},{"key":"26_CR3","unstructured":"Briskorn, D., Choi, B.-C., Lee, K., Leung, J., Pinedo, M.: Inventory constrained scheduling on a single machine. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel 640, Christian-Albrechts-Universit\u00e4t zu Kiel, Institut f\u00fcr Betriebswirtschaftslehre (2008)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.ejor.2010.05.036","volume":"207","author":"D Briskorn","year":"2010","unstructured":"Briskorn, D., Choi, B.-C., Lee, K., Leung, J., Pinedo, M.: Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2), 605\u2013619 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e4umker, E., Sch\u00fcle, F., Woias, P.: Development of a batteryless VHF-beacon and tracker for mammals. In: Journal of Physics: Conference Series, vol. 1052, p. 012005 (2018)","DOI":"10.1088\/1742-6596\/1052\/1\/012005"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1109\/JIOT.2018.2828943","volume":"5","author":"A Caruso","year":"2018","unstructured":"Caruso, A., Chessa, S., Escolar, S., del Toro, X., L\u00f3pez, J.C.: A dynamic programming algorithm for high-level task scheduling in energy harvesting IoT. IEEE Internet Things J. 5(3), 2234\u20132248 (2018)","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejor.2020.03.029","volume":"286","author":"M Davari","year":"2020","unstructured":"Davari, M., Ranjbar, M., De Causmaecker, P., Leus, R.: Minimizing makespan on a single machine with release dates and inventory constraints. Eur. J. Oper. Res. 286(1), 115\u2013128 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR8","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-319-10380-8_38","volume-title":"CONTROLO\u20192014 \u2013 Proceedings of the 11th Portuguese Conference on Automatic Control","author":"J Faceira","year":"2015","unstructured":"Faceira, J., Afonso, P., Salgado, P.: Prediction of solar radiation using artificial neural networks. In: Moreira, A.P., Matos, A., Veiga, G. (eds.) CONTROLO\u20192014. LNEE, vol. 321, pp. 397\u2013406. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-10380-8_38"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.mathsocsci.2011.04.004","volume":"62","author":"ER Gafarov","year":"2011","unstructured":"Gafarov, E.R., Lazarev, A.A., Werner, F.: Single machine scheduling problems with financial resource constraints: some complexity results and properties. Math. Soc. Sci. 62(1), 7\u201313 (2011)","journal-title":"Math. Soc. Sci."},{"issue":"6","key":"26_CR10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1002\/nav.20095","volume":"52","author":"A Grigoriev","year":"2005","unstructured":"Grigoriev, A., Holthuijsen, M., van de Klundert, J.: Basic scheduling problems with raw material constraints. Nav. Res. Logist. 52(6), 527\u2013535 (2005)","journal-title":"Nav. Res. Logist."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10951-013-0346-9","volume":"17","author":"P Gy\u00f6rgyi","year":"2014","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17, 135\u2013144 (2014)","journal-title":"J. Sched."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Islam, B., Nirjon, S.: Scheduling computational and energy harvesting tasks in deadline-aware intermittent systems. In: 2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 95\u2013109. IEEE (2020)","DOI":"10.1109\/RTAS48715.2020.00-14"},{"key":"26_CR13","unstructured":"Lucia, B., Balaji, V., Colin, A., Maeng, K., Ruppel, E.: Intermittent computing: challenges and opportunities. In: 2nd Summit on Advances in Programming Languages (SNAPL 2017) (2017)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Merrett, G.V.: Invited: energy harvesting and transient computing: a paradigm shift for embedded systems? In: 53rd ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp. 1\u20132 (2016)","DOI":"10.1145\/2897937.2905011"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Williams, R.: On the possibility of faster SAT algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1065\u20131075. SIAM (2010)","DOI":"10.1137\/1.9781611973075.86"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.rser.2015.11.010","volume":"55","author":"FK Shaikh","year":"2016","unstructured":"Shaikh, F.K., Zeadally, S.: Energy harvesting in wireless sensor networks: a comprehensive review. Renew. Sustain. Energy Rev. 55, 1041\u20131054 (2016)","journal-title":"Renew. Sustain. Energy Rev."},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/SURV.2011.060710.00094","volume":"13","author":"S Sudevalayam","year":"2010","unstructured":"Sudevalayam, S., Kulkarni, P.: Energy harvesting sensor nodes: survey and implications. IEEE Commun. Surv. Tutorials 13(3), 443\u2013461 (2010)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.08.031","volume":"465","author":"N Vakhania","year":"2012","unstructured":"Vakhania, N.: Branch less, cut more and minimize the number of late equal-length jobs on identical machines. Theoret. Comput. Sci. 465, 49\u201360 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10951-010-0181-1","volume":"13","author":"JM van den Akker","year":"2010","unstructured":"van den Akker, J.M., Diepen, G., Hoogeveen, J.A.H.: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. J. Sched. 13, 561\u2013576 (2010)","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27051-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:05:58Z","timestamp":1678665958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_26","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":"13 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"30","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":"40% - 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":"10","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)"}},{"value":"This proceeding includes 2 invited papers.","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)"}}]}}