Scheduling coupled tasks with time windows: a parameterized complexity analysis - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Scheduling coupled tasks with time windows: a parameterized complexity analysis

(1) , (2, 1) , (3)
1
2
3

Domains

Computer Science [cs] Computational Complexity [cs.CC] Computer Science [cs] Operations Research [cs.RO]
Fichier principal
Vignette du fichier
ipco23_companion_v1.pdf (420.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Claire HANEN  : Connect in order to contact the contributor

https://hal.science/hal-03837715

Submitted on : Wednesday, November 16, 2022-2:29:20 PM

Last modification on : Tuesday, November 22, 2022-3:53:07 AM

Download

Dates and versions

hal-03837715 , version 1 (16-11-2022)

Identifiers

  • HAL Id : hal-03837715 , version 1

Cite

Maher Mallem, Claire C. Hanen, Alix Munier-Kordon. Scheduling coupled tasks with time windows: a parameterized complexity analysis. 2022. ⟨hal-03837715⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS LIP6 SORBONNE-UNIVERSITE SU-SCIENCES UNIV-PARIS-LUMIERES UNIV-PARIS-NANTERRE
0 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More