{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:07:22Z","timestamp":1757621242878,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_19","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:27Z","timestamp":1754168967000},"page":"253-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Parameterized Algorithms for\u00a0Scheduling with\u00a0Precedence Constraints and\u00a0Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1415-0515","authenticated-orcid":false,"given":"Feng","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"issue":"2","key":"19_CR1","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":"19_CR2","doi-asserted-by":"crossref","unstructured":"Brucker, P.: Scheduling Algorithms, 4th edn. Springer (2004)","DOI":"10.1007\/978-3-540-24804-0"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Handbook of Combinatorial Optimization: Volume 1\u20133, pp. 1493\u20131641 (1998)","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"12","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E Demeulemeester","year":"1992","unstructured":"Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci. 38(12), 1803\u20131818 (1992)","journal-title":"Manage. Sci."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Warmuth, M.K.: Scheduling precedence graphs of bounded height. J. Algorithms 5(1), 48\u201359 (1984)","journal-title":"J. Algorithms"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: Two-processor scheduling with start-times and deadlines. SIAM J. Comput. 6(3), 416\u2013426 (1977)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10951-023-00788-4","volume":"27","author":"C Hanen","year":"2024","unstructured":"Hanen, C., Munier Kordon, A.: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. J. Sched. 27(2), 119\u2013133 (2024)","journal-title":"J. Sched."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"key":"19_CR12","unstructured":"Leung, J.Y.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC (2004)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., Van Bevern, R.: Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100, 254\u2013261 (2018)","journal-title":"Comput. Oper. Res."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Mnich, M., Wiese, A.: Scheduling meets fixed-parameter tractability. arXiv preprint arXiv:1311.4021 (2013)","DOI":"10.1007\/978-3-319-07557-0_32"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Algorithms and Order, pp. 105\u2013193. Springer (1989)","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2020.11.024","volume":"290","author":"A Munier Kordon","year":"2021","unstructured":"Munier Kordon, A.: A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. Discret. Appl. Math. 290, 1\u20136 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-017-0519-z","volume":"21","author":"D Prot","year":"2018","unstructured":"Prot, D., Bellenguez-Morineau, O.: A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. J. Sched. 21(1), 3\u201316 (2018)","journal-title":"J. Sched."},{"key":"19_CR18","unstructured":"Sprecher, A.: Solving the RCPSP efficiently at modest memory requirements. Technical report, Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universit\u00e4t Kiel (1996)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-031-39698-4_10","volume-title":"Euro-Par 2023: Parallel Processing","author":"I Tarhan","year":"2023","unstructured":"Tarhan, I., Carlier, J., Hanen, C., Jouglet, A., Munier Kordon, A.: Parameterized analysis of a dynamic programming algorithm for a parallel machine scheduling problem. In: Cano, J., Dikaiakos, M.D., Papadopoulos, G.A., Peric\u00e0s, M., Sakellariou, R. (eds.) Euro-Par 2023: Parallel Processing, pp. 139\u2013153. Springer, Cham (2023)"},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: Np-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Van\u00a0Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., Woeginger, G.J.: Precedence-constrained scheduling problems parameterized by partial order width. In: International Conference on Discrete Optimization and Operations Research, pp. 105\u2013120. Springer (2016)","DOI":"10.1007\/978-3-319-44914-2_9"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T12:44:28Z","timestamp":1757335468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}