Poids de l’Open access dans la production CNRS
Home
Resources
Graphs
Search
Export
Sign in
Titre
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
XX
BSO - Titre
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
XX
DOI
DOI
10.1007/s10951-016-0507-8
XX
DOAI
DOAI
10.1007/s10951-016-0507-8
XX
Identifiant WoS
WOS:000400364500007
XX
Accès ouvert
OA - Oui
XX
Source - Accès ouvert
OA - Non
XX
Type d'accès
Archive
XX
Editeur
Springer
XX
Source
JOURNAL OF SCHEDULING
XX
ISSN
1094-6136
XX
Type de document
Article
XX
Notoriété
2 - Acceptable
XX
CNRS
Oui
XX
CNRS - Institut
INS2I - Institut des sciences de l'information et de leurs interactions
XX
uid:/4CT0PQJ5
12/10/2021 14:52:41 (latest)
Add field
Share/Export
Powered by
Lodex
9.6.0
