<https://hal.archives-ouvertes.fr/hal-02062182#id>	<http://id.loc.gov/vocabulary/relators/aut>	<http://www.idref.fr/139498672/id> .
<https://hal.archives-ouvertes.fr/hal-02062182#id>	<http://id.loc.gov/vocabulary/relators/aut>	<http://www.idref.fr/113057474/id> .
<https://hal.archives-ouvertes.fr/hal-02062182#id>	<http://purl.org/dc/terms/bibliographicCitation>	"Wang Tianyu, Bellenguez-Morineau Odile. The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. Journal of Scheduling, Springer Verlag, 2019, &#x27E8;10.1007/s10951-018-0596-7&#x27E9;" .
<https://hal.archives-ouvertes.fr/hal-02062182#id>	<http://purl.org/dc/elements/1.1/date>	"2019" .
<https://hal.archives-ouvertes.fr/hal-02062182#id>	<http://purl.org/dc/terms/title>	"The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints" .