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)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.06.031

zbMATH Keywords

active schedulesfixed parameter tractable algorithmparameterized complexityscheduling

Mathematics Subject Classification ID

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

Cites work

• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
• A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
• Hierarchical models for multi-project planning and scheduling
• Introduction to algorithms.
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling resource-constrained projects competitively at modest memory requirements
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

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)