{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:41:44Z","timestamp":1740102104119,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100020487","name":"Nature","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020487","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,18]]},"DOI":"10.1109\/indin51400.2023.10218249","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T17:36:36Z","timestamp":1692725796000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Production Scheduling by Exploiting Repetitive Product Configurations"],"prefix":"10.1109","author":[{"given":"Niels","family":"Gr\u00fcuttemeier","sequence":"first","affiliation":[{"name":"Fraunhofer IOSB-INA,Lemgo,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaja","family":"Balzereit","sequence":"additional","affiliation":[{"name":"Fraunhofer IOSB-INA,Lemgo,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nehal","family":"Soni","sequence":"additional","affiliation":[{"name":"Fraunhofer IOSB-INA,Lemgo,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Bunte","sequence":"additional","affiliation":[{"name":"Fraunhofer IOSB-INA,Lemgo,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jii.2021.100257"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICPS51978.2022.9816866"},{"key":"ref15","volume":"3","author":"padberg","year":"2012","journal-title":"Location Scheduling Design and Integer Programming"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0830-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISSE49799.2020.9272247"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref22","first-page":"125113","volume":"7","author":"zhu","year":"2019","journal-title":"An adaptive real-time scheduling method for flexible job shop scheduling problem with combined processing constraint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2014.05.007"},{"key":"ref21","first-page":"122995","volume":"9","author":"zhao","year":"2021","journal-title":"Dynamic jobshop scheduling algorithm based on deep q network"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/07408170108936839"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_6"},{"journal-title":"SAP Documentation PP\/DS","article-title":"Automated production planning and optimization-heuristics","year":"2023","key":"ref17"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/00207729708929360"},{"key":"ref19","first-page":"19286","volume":"8","author":"wan","year":"2020","journal-title":"Efficiency-oriented production scheduling scheme an ant colony system method"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10951-016-0478-9","article-title":"A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack","volume":"20","author":"ren\u00e9","year":"2017","journal-title":"Journal of Scheduling"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"ref9","article-title":"Single machine batch scheduling to minimize the weighted number of tardy jobs","author":"hermelin","year":"2019","journal-title":"CoRR abs\/1911 12350"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.09.042"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00811-3"},{"key":"ref5","article-title":"Texts in Computer Science","author":"rodney","year":"2013","journal-title":"Fundamentals of Parameterized Complexity"}],"event":{"name":"2023 IEEE 21st International Conference on Industrial Informatics (INDIN)","start":{"date-parts":[[2023,7,18]]},"location":"Lemgo, Germany","end":{"date-parts":[[2023,7,20]]}},"container-title":["2023 IEEE 21st International Conference on Industrial Informatics (INDIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10217218\/10217836\/10218249.pdf?arnumber=10218249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T17:54:04Z","timestamp":1694454844000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10218249\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/indin51400.2023.10218249","relation":{},"subject":[],"published":{"date-parts":[[2023,7,18]]}}}