检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程》2012年第6期82-89,共8页Systems Engineering
基 金:国家自然科学基金资助项目(70971105);陕西省自然科学基金资助项目(2009JM9001);中央高校基本科研业务费专项
摘 要:从合同双方的联合视角出发,研究项目支付进度问题。其中,支付与项目事件相联系,任务是合理地安排支付事件、活动执行模式及事件发生时间,以使合同双方的共同收益最大化并使二者都能接受相应的安排。在对问题进行界定的基础上,构建由两个子模型构成的优化模型。针对问题的强NP-hard属性,设计包含两个子模块的模拟退火启发式算法,并在随机生成的标准算例集合上对算法进行测试,结果表明,该算法是求解问题的有效算法。最后,用一个算例对研究进行说明,得到如下结论:如果合同双方均按自身偏好进行决策,那么将会导致一种双输的结果;如果他们能够相互合作和协调,那么都可从项目中获得更高的收益。本文的研究可以为合同双方关于项目支付进度安排的谈判提供决策支持。This paper involves the project payment scheduling problem from a joint perspective of two parties of contract. In this problem, payments are attached to events and the task is to arrange payment events, performing mode of activities, and occurrence time of events reasonably so as to maximize the joint revenue of the two parties and make them willing to accept the relative arrangement in the meantime. On the basis of the identification of the problem, the optimization model composed of two submodels is constructed. It. view of the strong NP-hardness of the problem, a simulated annealing heuristic algorithm which consists of two modules is developed. The algorithm is tested on a data set of standard instances generated randomly and the result shows that it is an efficient algorithm for the problem studied. Ultimately, an example is utilized to illustrate the significance of the study and the following conclusion is drawn: If the two parties of contract make decisions according to their own preference, they will get an outcome which is bad for both parties. However, if they take a cooperative attitude and coordinate with each other, they will obtain more profits from the project. The research in this paper can provide decision supports for the two parties of contract in the negotiation on project payment scheduling.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173