摘要
在分析虚拟企业协商调整项目规划方案的不确定性因素的基础上,建立了工期—费用离散概率模型,提出了可快速判断是否有可行解的判据准则,并结合示例解释其过程。最后,针对模具生产的特点,提出了一种基于约束满足的近似搜索算法,并通过生产实例说明了这一方法的有效性和可靠性。
Uncertain factors of negotiation-based project rescheduling were analyzed firstly,and the discrete ratio model was also constructed.Then the criterion rules for rapid estimating rescheduling schemes' feasibility were proposed.Next,a project rescheduling process was drawn up by a simple example.Aiming at production characteristics of die industry,an approximate search algorithm based on constraint satisfaction problem was put forward.The effectiveness and reliability of the proposed algorithm were proved by an application example.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2007年第11期2145-2153,共9页
Computer Integrated Manufacturing Systems
基金
国家863/CIMS主题资助项目(2003AA414023)
国家自然科学基金资助项目(50085001)
仲恺农业技术学院校级资助项目(G2360242)。~~
关键词
虚拟企业
项目调度
约束满足
协商
模具
virtual enterprise
project scheduling
constraint satisfaction problem
negotiation
mould die