Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete

Theoretical Computer Science 2026 Open access

Read full text

Authors: Maher Mallem, Claire Hanen, Alix Munier-Kordon

DOI: 10.1016/j.tcs.2026.115813

Cited by: 0

References: 16

Fields of Study & Subjects

Scheduling and Optimization Algorithms Advanced Graph Theory Research Complexity and Algorithms in Graphs

References 16