{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:01:42Z","timestamp":1743066102475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_10","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"142-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Production Scheduling with Stock- and Staff-Related Restrictions"],"prefix":"10.1007","author":[{"given":"Carlo S.","family":"Sartori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius","family":"Gandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hatice","family":"\u00c7al\u0131k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Smet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70\u201378 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"10_CR2","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1080\/07408170490447366","volume":"36","author":"K Charnsirisakskul","year":"2004","unstructured":"Charnsirisakskul, K., Griffin, P.M., Keskinocak, P.: Order selection and scheduling with leadtime flexibility. IIE Trans. 36(7), 697\u2013707 (2004)","journal-title":"IIE Trans."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2016","unstructured":"Copil, K., W\u00f6rbelauer, M., Meyr, H., Tempelmeier, H.: Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectrum 39(1), 1\u201364 (2016). https:\/\/doi.org\/10.1007\/s00291-015-0429-4","journal-title":"OR Spectrum"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl, A., Kimms, A.: Lot sizing and scheduling - survey and extensions. Eur. J. Oper. Res. 99(2), 221\u2013235 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","volume":"44","author":"B Fleischmann","year":"1990","unstructured":"Fleischmann, B.: The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44(3), 337\u2013348 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.3390\/a13060138","volume":"13","author":"A Goerler","year":"2020","unstructured":"Goerler, A., Lalla-Ruiz, E., Vo\u00df, S.: Late acceptance hill-climbing matheuristic for the general lot sizing and scheduling problem with rich constraints. Algorithms 13(6), 138 (2020)","journal-title":"Algorithms"},{"key":"10_CR7","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"10_CR8","unstructured":"Sartori, C.S., Gandra, V., \u00c7alik, H., Smet, P.: Instances for production scheduling with stock- and staff-related restrictions. Mendeley Data, V2 at http:\/\/dx.doi.org\/10.17632\/rpbv622wyd.2 (2021). Accessed 26 July 2021"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.cor.2017.09.006","volume":"90","author":"YLT Silva","year":"2018","unstructured":"Silva, Y.L.T., Subramanian, A., Pessoa, A.A.: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Comput. Oper. Res. 90, 142\u2013160 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212(1), 1\u201311 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s00291-015-0410-2","volume":"38","author":"H Tempelmeier","year":"2015","unstructured":"Tempelmeier, H., Copil, K.: Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator. OR Spectrum 38(4), 819\u2013847 (2015). https:\/\/doi.org\/10.1007\/s00291-015-0410-2","journal-title":"OR Spectrum"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-018-0536-0","volume":"41","author":"M W\u00f6rbelauer","year":"2018","unstructured":"W\u00f6rbelauer, M., Meyr, H., Almada-Lobo, B.: Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification. OR Spectrum 41(1), 1\u201343 (2018). https:\/\/doi.org\/10.1007\/s00291-018-0536-0","journal-title":"OR Spectrum"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:06:36Z","timestamp":1632258396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","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":"42","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":"38% - 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.5","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)"}}]}}