任何人都可以想到如何找到最低成本的项目管理（CPM）的任何解决方案 [英] anyone can think of any solution how to find a lowest cost of project management (CPM)

问题描述

我有数据清单



list proj_name = {A，B，C，D，E，F}

列表持续时间= {6,10,5,4,9,2}

list faster_duration = {6,8,4,1,7,1}

list cost = { - ，500,300,700,600,800}



如果关键路径是ABF和CDEF



i知道我们可以使用intersec来找到相同的proj_name但是如果有超过2个关键路径知道如何找到它就不能使用吗？



每天的费用是1150

i got lists of data

list proj_name = { A,B,C,D,E,F}
list duration = { 6,10,5,4,9,2}
list fastest_duration = {6,8,4,1,7,1}
list cost = {-,500,300,700,600,800}

if critical path was A-B-F and C-D-E-F

i know that we can use intersec to find the same proj_name but it can't be use if there was more than 2 Critical path any know how to find it ?

the cost per day was 1150

推荐答案

这篇关于任何人都可以想到如何找到最低成本的项目管理（CPM）的任何解决方案的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！