FPT implicit enumeration of active schedules

We consider in this paper the resource constrained scheduling problem with release times and deadlines. We develop an original dynamic programming algorithm generating a compact representation of all feasible active schedules for the decision problem inspired from classical branch-and-bound approach...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 376; pp. 235 - 250
Main Authors:	Tarhan, İstenç, Hanen, Claire, Kordon, Alix Munier, Carlier, Jacques, Jouglet, Antoine
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.12.2025 Elsevier
Subjects:	Active schedules Computer Science Fixed parameter tractable algorithm Parameterized complexity Scheduling Scheduling Active schedules Fixed parameter tractable algorithm Parameterized complexity
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!