FPT implicit enumeration of active schedules

DOI10.1016/J.DAM.2025.06.031MaRDI QIDQ6930333zbMATH OpenFDO

Authors İstenç Tarhan, Claire Hanen, Alix Munier-Kordon, Jacques Carlier, Antoine Jouglet

Publication date 16 September 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

schedulingparameterized complexityfixed parameter tractable algorithmactive schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: FPT implicit enumeration of active schedules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930333)