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

Saved in:
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!
Description
Summary: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 approaches with no time windows. This algorithm is proved to be fixed-parameter tractable (FPT in short) parameterized by the maximum number of jobs overlapping following time windows and the maximum processing time. New dominance rules are also presented to improve the time complexity of our algorithm. Lastly, we also develop an enhanced version of our algorithm to optimize any regular separable objective function. It is shown that this new version of our algorithm has the same time complexity and hence is FPT with the relevant two parameters. •A generic resource constrained scheduling problem with time windows is introduced.•Fixed-parameter tractable (FPT) algorithm is proposed to generate active schedules.•The FPT algorithm is enhanced to optimize regular objective functions.
ISSN:0166-218X
DOI:10.1016/j.dam.2025.06.031