Cargando…
A double-decomposition based parallel exact algorithm for the feedback length minimization problem
Product development projects usually contain many interrelated activities with complex information dependences, which induce activity rework, project delay and cost overrun. To reduce negative impacts, scheduling interrelated activities in an appropriate sequence is an important issue for project ma...
Autores principales: | Shang, Zhen, Hao, Jin-Kao, Ma, Fei |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10588706/ https://www.ncbi.nlm.nih.gov/pubmed/37869465 http://dx.doi.org/10.7717/peerj-cs.1597 |
Ejemplares similares
-
Dynamic thresholding search for the feedback vertex set problem
por: Sun, Wen, et al.
Publicado: (2023) -
GPUTreeShap: massively parallel exact calculation of SHAP scores for tree ensembles
por: Mitchell, Rory, et al.
Publicado: (2022) -
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
por: Hao, Tan, et al.
Publicado: (2023) -
A new parallel multi-objective Harris hawk algorithm for predicting the mortality of COVID-19 patients
por: Dokeroglu, Tansel
Publicado: (2023)