{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:55Z","timestamp":1742912875312,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-53262-8_14","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times"],"prefix":"10.1007","author":[{"given":"Krist\u00f3f","family":"B\u00e9rczi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Omlor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e9rczi, K., Kir\u00e1ly, T., Omlor, S.: Scheduling with non-renewable resources: minimizing the sum of completion times (2019). https:\/\/arxiv.org\/abs\/1911.12138. Preprint","DOI":"10.1007\/978-3-030-53262-8_14"},{"key":"14_CR2","unstructured":"Carlier, J.: Probl\u00e8mes d\u2019ordonnancement \u00e0 contraintes de ressources: algorithmes et complexit\u00e9. Universit\u00e9 Paris VI-Pierre et Marie Curie, Institut de programmation (1984)"},{"issue":"1","key":"14_CR3","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."},{"key":"14_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness (1979)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"6","key":"14_CR6","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. Naval Res. Logist. (NRL) 52(6), 527\u2013535 (2005)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"6","key":"14_CR7","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.orl.2017.09.007","volume":"45","author":"P Gy\u00f6rgyi","year":"2017","unstructured":"Gy\u00f6rgyi, P.: A ptas for a resource scheduling problem with arbitrary number of parallel machines. Oper. Res. Lett. 45(6), 604\u2013609 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10951-013-0346-9","volume":"17","author":"P Gy\u00f6rgyi","year":"2013","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Approximation schemes for single machine scheduling with non-renewable resource constraints. J. Sched. 17(2), 135\u2013144 (2013). https:\/\/doi.org\/10.1007\/s10951-013-0346-9","journal-title":"J. Sched."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10479-015-1993-3","volume":"235","author":"P Gy\u00f6rgyi","year":"2015","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Approximability of scheduling problems with resource consuming jobs. Ann. Oper. Res. 235(1), 319\u2013336 (2015). https:\/\/doi.org\/10.1007\/s10479-015-1993-3","journal-title":"Ann. Oper. Res."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2014.11.007","volume":"565","author":"P Gy\u00f6rgyi","year":"2015","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Reductions between scheduling problems with non-renewable resources and knapsack problems. Theoret. Comput. Sci. 565, 63\u201376 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ejor.2016.09.007","volume":"258","author":"P Gy\u00f6rgyi","year":"2017","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Approximation schemes for parallel machine scheduling with non-renewable resources. Eur. J. Oper. Res. 258(1), 113\u2013123 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.cie.2017.11.016","volume":"115","author":"P Gy\u00f6rgyi","year":"2018","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut. Comput. Ind. Eng. 115, 220\u2013225 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10951-019-00601-1","volume":"22","author":"P Gy\u00f6rgyi","year":"2019","unstructured":"Gy\u00f6rgyi, P., Kis, T.: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Sched. 22(6), 623\u2013634 (2019). https:\/\/doi.org\/10.1007\/s10951-019-00601-1","journal-title":"J. Sched."},{"key":"14_CR14","unstructured":"Gy\u00f6rgyi, P., Kis, T.: New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. arXiv preprint arXiv:2004.00972 (2020). Earlier version: EGRES Technical Report 2019\u201305, egres.elte.hu"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.orl.2015.09.004","volume":"43","author":"T Kis","year":"2015","unstructured":"Kis, T.: Approximability of total weighted completion time with resource consuming jobs. Oper. Res. Lett. 43(6), 595\u2013598 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0377-2217(84)90105-X","volume":"15","author":"R Slowi\u0144ski","year":"1984","unstructured":"Slowi\u0144ski, R.: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. Eur. J. Oper. Res. 15(3), 366\u2013373 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"14_CR17","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1057\/jors.1991.152","volume":"42","author":"A Toker","year":"1991","unstructured":"Toker, A., Kondakci, S., Erkip, N.: Scheduling under a non-renewable resource constraint. J. Oper. Res. Soc. 42(9), 811\u2013814 (1991)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-6377(97)00007-2","volume":"21","author":"J Xie","year":"1997","unstructured":"Xie, J.: Polynomial algorithms for single machine scheduling problems with financial constraints. Oper. Res. Lett. 21(1), 39\u201342 (1997)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:08:58Z","timestamp":1710266938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_14","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":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","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":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","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":"24","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":"36% - 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":"2.26","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":"3.85","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}