{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:08:59Z","timestamp":1742911739952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609237"},{"type":"electronic","value":"9783031609244"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60924-4_16","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:27Z","timestamp":1716349107000},"page":"205-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Structural Parameter on\u00a0Single Machine Scheduling with\u00a0Release Dates and\u00a0Deadlines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5654-1090","authenticated-orcid":false,"given":"Maher","family":"Mallem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2482-5042","authenticated-orcid":false,"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2170-6366","authenticated-orcid":false,"given":"Alix","family":"Munier-Kordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2020.09.042","volume":"291","author":"R Baart","year":"2021","unstructured":"Baart, R., de Weerdt, M., He, L.: Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur. J. Oper. Res. 291(2), 629\u2013639 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0272-6963(84)90026-3","volume":"4","author":"KR Baker","year":"1984","unstructured":"Baker, K.R.: The effects of input control in a simple scheduling model. J. Oper. Manag. 4(2), 99\u2013112 (1984)","journal-title":"J. Oper. Manag."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Fellows, M.R.: W[2]-hardness of precedence constrained k-processor scheduling. Oper. Res. Lett. 18(2), 93\u201397 (1995)","journal-title":"Oper. Res. Lett."},{"key":"16_CR4","unstructured":"Bodlaender, H.L., van\u00a0der Wegen, M.: Parameterized complexity of scheduling chains of jobs with delays. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation (IPEC), December 14-18 2020, Hong Kong, China (Virtual Conference), LIPIcs, vol.\u00a0180, pp. 1\u201315 (2020)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science()","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-44914-2_9","volume-title":"Discrete Optimization and Operations Research","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., van Bevern, R., Woeginger, G.J.: Precedence-constrained scheduling problems parameterized by partial order width. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) Discrete Optimization and Operations Research. Lecture Notes in Computer Science(), vol. 9869, pp. 105\u2013120. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_9"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Cham (1999)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.W.: Descriptive complexity and the W hierarchy. In: Proof Complexity and Feasible Arithmetics, pp. 119\u2013134 (1996)","DOI":"10.1090\/dimacs\/039\/07"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1051\/ro\/1985190100151","volume":"19","author":"J Erschler","year":"1985","unstructured":"Erschler, J., Fontan, G., Merce, C.: Un nouveau concept de dominance pour l\u2019ordonnancement de travaux sur une machine. RAIRO-Oper. Res. 19(1), 15\u201326 (1985)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/OPRE.31.1.114","volume":"31","author":"J Erschler","year":"1983","unstructured":"Erschler, J., Fontan, G., Merc\u00e9, C., Roubellat, F.: A new dominance concept in scheduling n jobs on a single machine with ready times and due dates. Oper. Res. 31(1), 114\u2013127 (1983). https:\/\/doi.org\/10.1287\/OPRE.31.1.114","journal-title":"Oper. Res."},{"key":"16_CR10","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"1998","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Cham (1998)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1051\/ro:2001103","volume":"35","author":"VS Gordon","year":"2001","unstructured":"Gordon, V.S., Werner, F., Yanushkevich, O.: Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release\/due date intervals. RAIRO-Oper. Res. 35(1), 71\u201383 (2001)","journal-title":"RAIRO-Oper. Res."},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Grigoreva, N.: Single machine scheduling with precedence constrains, release and delivery times. In: Wilimowska, Z., Borzemski, L., Swiatek, J. (eds.) Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology \u2013 ISAT 2019. Advances in Intelligent Systems and Computing, vol. 1052, pp. 188\u2013198. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-30443-0_17","DOI":"10.1007\/978-3-030-30443-0_17"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"LA Hall","year":"1992","unstructured":"Hall, L.A., Shmoys, D.B.: Jackson\u2019s rule for single-machine scheduling: Making a good heuristic better. Math. Oper. Res. 17(1), 22\u201335 (1992)","journal-title":"Math. Oper. Res."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Hanen, C., Munier\u00a0Kordon, A.: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. J. Sched., 1\u201315 (2023)","DOI":"10.1007\/s10951-023-00788-4"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10479-018-2852-9","volume":"298","author":"D Hermelin","year":"2021","unstructured":"Hermelin, D., Karhi, S., Pinedo, M., Shabtay, D.: New algorithms for minimizing the weighted number of tardy jobs on a single machine. Ann. Oper. Res. 298(1), 271\u2013287 (2021)","journal-title":"Ann. Oper. Res."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science()","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-030-85665-6_7","volume-title":"Euro-Par 2021: Parallel Processing","author":"AM Kordon","year":"2021","unstructured":"Kordon, A.M., Tang, N.: A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays. In: Sousa, L., Roma, N., Tomas, P. (eds.) Euro-Par 2021: Parallel Processing. Lecture Notes in Computer Science(), vol. 12820, pp. 105\u2013119. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85665-6_7"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manage. Sci. 19(5), 544\u2013546 (1973)","journal-title":"Manage. Sci."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"16_CR19","unstructured":"Mallem, M., Hanen, C., Munier-Kordon, A.: Parameterized complexity of a parallel machine scheduling problem. In: 17th International Symposium on Parameterized and Exact Computation (IPEC) (2022)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-014-0830-9","volume":"154","author":"M Mnich","year":"2015","unstructured":"Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. Math. Program. 154(1), 533\u2013562 (2015)","journal-title":"Math. Program."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Proskurowski, A., Telle, J.A.: Classes of graphs with restricted interval models. Discrete Math. Theor. Comput. Sci. 3 (1999)","DOI":"10.46298\/dmtcs.263"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/jos.71","volume":"4","author":"F Sourd","year":"2001","unstructured":"Sourd, F., Nuijten, W.: Scheduling with tails and deadlines. J. Sched. 4(2), 105\u2013121 (2001)","journal-title":"J. Sched."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Ware, E.B.: Job shop simulation on the IBM 704. In: Preprints of Papers Presented at the 14th National Meeting of the Association for Computing Machinery (1959)","DOI":"10.1145\/612268.612269"}],"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-031-60924-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:39:21Z","timestamp":1716349161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60924-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609237","9783031609244"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60924-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","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":"La Laguna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}