{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:12:29Z","timestamp":1778818349550,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2020JJ4949"],"award-info":[{"award-number":["2020JJ4949"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025JJ50395"],"award-info":[{"award-number":["2025JJ50395"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472449"],"award-info":[{"award-number":["62472449"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62332020"],"award-info":[{"award-number":["62332020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115947","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T23:14:21Z","timestamp":1775690061000},"page":"115947","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Parameterized algorithms and complexity for scheduling with precedence constraints and time windows"],"prefix":"10.1016","volume":"1076","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[]},{"given":"Na","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Yicong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jingyi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guangwei","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115947_bib0001","series-title":"Handbook of Combinatorial Optimization: 1\u20133","first-page":"1493","article-title":"A review of machine scheduling: complexity, algorithms and approximability","author":"Chen","year":"1998"},{"key":"10.1016\/j.tcs.2026.115947_bib0002","series-title":"Scheduling Algorithms (4th ed.)","author":"Brucker","year":"2004"},{"key":"10.1016\/j.tcs.2026.115947_bib0003","series-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Leung","year":"2004"},{"issue":"1","key":"10.1016\/j.tcs.2026.115947_bib0004","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-017-0519-z","article-title":"A survey on how the structure of precedence constraints may change the complexity class of scheduling problems","volume":"21","author":"Prot","year":"2018","journal-title":"J. Sched."},{"key":"10.1016\/j.tcs.2026.115947_bib0005","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":"Ann. Discrete Math."},{"issue":"02","key":"10.1016\/j.tcs.2026.115947_bib0006","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1142\/S0129054104002480","article-title":"Scheduling to minimize max flow time: off-line and on-line algorithms","volume":"15","author":"Mastrolilli","year":"2004","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115947_bib0007","series-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001)","first-page":"84","article-title":"Algorithms for minimizing weighted flow time","author":"Chekuri","year":"2001"},{"key":"10.1016\/j.tcs.2026.115947_bib0008","series-title":"Complexity of machine scheduling problems","first-page":"343","volume":"1","author":"Lenstra","year":"1977"},{"key":"10.1016\/j.tcs.2026.115947_bib0009","series-title":"Computers and intractability","volume":"29","author":"Garey","year":"2002"},{"issue":"11","key":"10.1016\/j.tcs.2026.115947_bib0010","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1145\/358690.363066","article-title":"Computer-aided complexity classification of combinational problems","volume":"25","author":"Lageweg","year":"1982","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2026.115947_bib0011","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","article-title":"Scheduling chain-structured tasks to minimize makespan and mean flow time","volume":"92","author":"Du","year":"1991","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.115947_bib0012","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","article-title":"Two-processor scheduling with start-times and deadlines","volume":"6","author":"Garey","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.115947_bib0013","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115947_bib0014","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","article-title":"Parameterized complexity of machine scheduling: 15 open problems","volume":"100","author":"Mnich","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115947_bib0015","series-title":"Proceedings of the Conference on Information Sciences and System (CISS 1976)","first-page":"543","article-title":"A new algorithm for the scheduling of tree structured tasks","author":"Davida","year":"1976"},{"issue":"3","key":"10.1016\/j.tcs.2026.115947_bib0016","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.tcs.2026.115947_bib0017","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","article-title":"Scheduling opposing forests","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/j.tcs.2026.115947_bib0018","series-title":"Parameterized Algorithms","volume":"5","author":"Cygan","year":"2015"},{"issue":"1","key":"10.1016\/j.tcs.2026.115947_bib0019","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.tcs.2026.115947_bib0020","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","article-title":"Scheduling precedence graphs of bounded height","volume":"5","author":"Dolev","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.115947_bib0021","series-title":"Algorithms and Order","first-page":"105","article-title":"Computationally tractable classes of ordered sets","author":"M\u00f6hring","year":"1989"},{"issue":"2","key":"10.1016\/j.tcs.2026.115947_bib0022","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","article-title":"W[2]-hardness of precedence constrained k-processor scheduling","volume":"18","author":"Bodlaender","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2026.115947_bib0023","series-title":"Proceedings of the 9th International Conference on Discrete Optimization and Operations Research (DOOR 2016)","first-page":"105","article-title":"Precedence-constrained scheduling problems parameterized by partial order width","author":"Van Bevern","year":"2016"},{"key":"10.1016\/j.tcs.2026.115947_bib0024","unstructured":"M. Mnich, A. Wiese, Scheduling meets fixed-parameter tractability, (2013). arXiv: 1311.4021."},{"key":"10.1016\/j.tcs.2026.115947_bib0025","first-page":"1","article-title":"A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows","volume":"290","author":"Munier Kordon","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115947_bib0026","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10951-023-00788-4","article-title":"Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines","volume":"27","author":"Hanen","year":"2024","journal-title":"J. Sched."},{"key":"10.1016\/j.tcs.2026.115947_bib0027","series-title":"Proceedings of the European Conference on Parallel Processing (Euro-Par 2023)","first-page":"139","article-title":"Parameterized analysis of a dynamic programming algorithm for a parallel machine scheduling problem","author":"Tarhan","year":"2023"},{"issue":"12","key":"10.1016\/j.tcs.2026.115947_bib0028","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Manage. Sci."},{"key":"10.1016\/j.tcs.2026.115947_bib0029","series-title":"Technical Report","article-title":"Solving the RCPSP Efficiently at Modest Memory Requirements","author":"Sprecher","year":"1996"},{"key":"10.1016\/j.tcs.2026.115947_bib0030","series-title":"Proceedings of the 31st International Computing and Combinatorics Conference (COCOON 2025)","first-page":"253","article-title":"Improved parameterized algorithms for scheduling with precedence constraints and time windows","author":"Shi","year":"2025"},{"key":"10.1016\/j.tcs.2026.115947_bib0031","first-page":"1","article-title":"Sharp bounds for the Lambert W function","volume":"29","author":"Alzahrani","year":"2018","journal-title":"Integr. Transf. Special Funct."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002069?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002069?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:54Z","timestamp":1778815434000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":31,"alternative-id":["S0304397526002069"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115947","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parameterized algorithms and complexity for scheduling with precedence constraints and time windows","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115947","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115947"}}