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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 376; s. 235 - 250
Hlavní autori:	Tarhan, İstenç, Hanen, Claire, Kordon, Alix Munier, Carlier, Jacques, Jouglet, Antoine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.12.2025 Elsevier
Predmet:	Active schedules Computer Science Fixed parameter tractable algorithm Parameterized complexity Scheduling Scheduling Active schedules Fixed parameter tractable algorithm Parameterized complexity
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!