{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:41:48Z","timestamp":1782405708010,"version":"3.54.5"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T00:00:00Z","timestamp":1702512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10951-023-00798-2","type":"journal-article","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:03:04Z","timestamp":1702569784000},"page":"225-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic scheduling problems in theory and practice"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1648-6987","authenticated-orcid":false,"given":"Stanis\u0142aw","family":"Gawiejnowicz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertrand Miao-Tsong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,14]]},"reference":[{"key":"798_CR1","doi-asserted-by":"publisher","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Springer. https:\/\/doi.org\/10.1007\/978-3-642-41880-8","DOI":"10.1007\/978-3-642-41880-8"},{"key":"798_CR2","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56, 1642\u20131661. https:\/\/doi.org\/10.1080\/00207543.2017.1355576","journal-title":"International Journal of Production Research"},{"key":"798_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-019-00630-w","volume":"23","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz, S. (2020a). A review of four decades of time-dependent scheduling: Main results, new topics, and open problems. Journal of Scheduling, 23, 3\u201347. https:\/\/doi.org\/10.1007\/s10951-019-00630-w","journal-title":"Journal of Scheduling"},{"key":"798_CR4","doi-asserted-by":"publisher","unstructured":"Gawiejnowicz, S. (2020b). Models and algorithms of time-dependent scheduling. Springer. https:\/\/doi.org\/10.1007\/978-3-662-59362-2","DOI":"10.1007\/978-3-662-59362-2"},{"key":"798_CR5","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643\u20131666. https:\/\/doi.org\/10.1016\/j.dam.2007.02.003","journal-title":"Discrete Applied Mathematics"},{"key":"798_CR6","unstructured":"Special issue: Dynamic scheduling problems. https:\/\/link.springer.com\/journal\/10951\/volumes-and-issues\/23-6\/"},{"key":"798_CR7","doi-asserted-by":"publisher","unstructured":"Strusevich, V. A., & Rustogi, K. (2017). Scheduling with time-changing effects and rate-modifying activities. Springer. https:\/\/doi.org\/10.1007\/978-3-319-39574-6","DOI":"10.1007\/978-3-319-39574-6"},{"key":"798_CR8","unstructured":"The first international workshop on dynamic scheduling problems: Extended abstracts, Polish Mathematical Society, Warsaw, 2016. https:\/\/iwdsp2016.wmi.amu.edu.pl\/wp-content\/uploads\/2015\/12\/iwdsp2016.pdf"},{"key":"798_CR9","unstructured":"The second international workshop on dynamic scheduling problems: Extended abstracts, Polish Mathematical Society, Warsaw, 2018. https:\/\/iwdsp2018.wmi.amu.edu.pl\/wp-content\/uploads\/2018\/09\/iwdsp2018.pdf"},{"key":"798_CR10","unstructured":"The third international workshop on dynamic scheduling problems: Extended abstracts, Polish Mathematical Society, Warsaw, 2021. https:\/\/iwdsp2021.wmi.amu.edu.pl\/wp-content\/uploads\/2021\/07\/iwdsp2021.pdf"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00798-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00798-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00798-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T07:19:01Z","timestamp":1747293541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00798-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,14]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["798"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00798-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,14]]},"assertion":[{"value":"4 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}