Conceptio › Archive › HAL (France)
HAL (France)open access

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

Maher Mallem et al.
HAL (France) · Papers · License: Open Access
Open Source ↗
scheduling
Precedence delays, Parameterized complexity, Scheduling, 1, Coupled tasks, Single machine, 0
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 129474
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.