Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Tianyu Wang, Odile Bellenguez-Morineau. A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. J. Scheduling, 22(6):709-714, 2019. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence ConstraintsTianyu Wang, Odile Bellenguez-Morineau. scheduling, 22(3):263-269, 2019. [doi] A note on NP-hardness of preemptive mean flow-time scheduling for parallel machinesOdile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot. scheduling, 18(3):299-304, 2015. [doi]
The following publications are possibly variants of this publication: