Article Dans Une Revue Discrete Applied Mathematics Année : 2025

FPT implicit enumeration of active schedules

Résumé

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.

Dates et versions

hal-05154996 , version 1 (09-07-2025)

Identifiants

Citer

İstenç Tarhan, Claire C. Hanen, Alix Munier-Kordon, Jacques Carlier, Antoine Jouglet. FPT implicit enumeration of active schedules. Discrete Applied Mathematics, 2025, 376, pp.235-250. ⟨10.1016/j.dam.2025.06.031⟩. ⟨hal-05154996⟩
497 Consultations
0 Téléchargements

Altmetric

Partager

  • More