{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:28Z","timestamp":1742914048571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031490071"},{"type":"electronic","value":"9783031490088"}],"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-49008-8_38","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:04:15Z","timestamp":1702559055000},"page":"483-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0156-3561","authenticated-orcid":false,"given":"Nikolai","family":"Antonov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4895-157X","authenticated-orcid":false,"given":"P\u0159emysl","family":"\u0160ucha","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3487-784X","authenticated-orcid":false,"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Croce, F.D., Grosso, A., T\u2019kindt, V.: Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1), 39\u201347 (2010)","DOI":"10.1007\/s10951-008-0092-6"},{"issue":"2","key":"38_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Bou\u0161ka, M., \u0160cha, P., Nov\u00e1k, A., Hanz\u00e1lek, Z.: Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness. Eur. J. Oper. Res. (2022)","DOI":"10.1016\/j.ejor.2022.11.034"},{"key":"38_CR4","unstructured":"Erickson, N., Mueller, J., Shirkov, A., Zhang, H., Larroy, P., Li, M., Smola, A.J.: AutoGluon-tabular: robust and accurate AutoML for structured data. CoRR arXiv:abs\/2003.06505 (2020)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"12","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1287\/mnsc.40.12.1712","volume":"40","author":"AMA Hariri","year":"1994","unstructured":"Hariri, A.M.A., Potts, C.N.: Single machine scheduling with deadlines to minimize the weighted number of tardy jobs. Manage. Sci. 40(12), 1712\u20131719 (1994)","journal-title":"Manage. Sci."},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ejor.2021.07.002","volume":"298","author":"L Hejl","year":"2022","unstructured":"Hejl, L., \u0160\u016fcha, P., Nov\u00e1k, A., Hanz\u00e1lek, Z.: Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances. Eur. J. Oper. Res. 298(2), 413\u2013424 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Li, Y., Fadda, E., Manerba, D., Tadei, R., Terzo, O.: Reinforcement learning algorithms for online single-machine scheduling. In: 2020 15th Conference on Computer Science and Information Systems (FedCSIS), pp. 277\u2013283 (2020)","DOI":"10.15439\/2020F100"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134 (2021)","DOI":"10.1016\/j.cor.2021.105400"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Parmentier, A., T\u2019Kindt, V.: Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times. Eur. J. Oper. Res. (2022)","DOI":"10.1016\/j.ejor.2022.06.040"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L.: Scheduling. Theory, Algorithms, and Systems, p. 233. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-2361-4"},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-016-0479-8","volume":"20","author":"J Yuan","year":"2017","unstructured":"Yuan, J.: Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J. Sched. 20(2), 211\u2013218 (2017)","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49008-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:19:29Z","timestamp":1702559969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49008-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031490071","9783031490088"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49008-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faial Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"5 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2023.inesctec.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"163","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":"85","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":"52% - 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":"4","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","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)"}}]}}