Parameterized algorithms and complexity for scheduling with precedence constraints and time windows
Theoretical Computer Science · 2026-06 · 1076 · 115947
DOI: 10.1016/j.tcs.2026.115947 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Feng Shi und 5 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: Hunan Provincial Natural Science Foundation, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Hunan Provincial Natural Science Foundation
- National Natural Science Foundation of China
Zitieren
APA
Shi, F., Feng, N., Zhu, Y., Liu, J., Wang, J., & Wu, G. (2026). Parameterized algorithms and complexity for scheduling with precedence constraints and time windows. Theoretical Computer Science, 1076, 115947. https://doi.org/10.1016/j.tcs.2026.115947
Vancouver
Shi F, Feng N, Zhu Y, Liu J, Wang J, Wu G. Parameterized algorithms and complexity for scheduling with precedence constraints and time windows. Theoretical Computer Science. 2026;1076:115947. doi:10.1016/j.tcs.2026.115947
BibTeX
@article{Shi2026,
author = {Shi, Feng and Feng, Na and Zhu, Yicong and Liu, Jingyi and Wang, Jianxin and Wu, Guangwei},
title = {Parameterized algorithms and complexity for scheduling with precedence constraints and time windows},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1076},
pages = {115947},
doi = {10.1016/j.tcs.2026.115947}
}
EUVIMED