期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
动态加强CPT解job-shop调度约束满足优化问题 被引量:1
1
作者 冯欣 唐立新 王梦光 《系统工程学报》 CSCD 北大核心 2006年第6期583-590,共8页
带有相同到达期与交货期的job-shop调度问题(JSSP)作为多种实际生产调度问题简化模型,是一类典型强NP-hard问题.对优化目标是最小化最大完工时间的JSSP问题,建立了约束满足优化问题模型(JSSC-SOP).利用弧一致约束传播算法和深度优先启... 带有相同到达期与交货期的job-shop调度问题(JSSP)作为多种实际生产调度问题简化模型,是一类典型强NP-hard问题.对优化目标是最小化最大完工时间的JSSP问题,建立了约束满足优化问题模型(JSSC-SOP).利用弧一致约束传播算法和深度优先启发式构造活动调度,逐步加入新约束,实现活动调度集的部分列举与寻优.提出3种动态加强约束传播技术(CPT),嵌入搜索过程,提高求解效率.最后通过随机生成的实例,验证了各方法可行性与有效性. 展开更多
关键词 JOB-SHOP调度 约束满足优化问题 活动调度 约束传播技术
下载PDF
An Optimized Constraint Decomposition Method in Concurrent Engineering
2
作者 常天庆 Xu Wensheng +1 位作者 Xiong Guangleng Xing Siming 《High Technology Letters》 EI CAS 2003年第2期72-77,共6页
In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved... In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution. 展开更多
关键词 Constraint Satisfaction Problems constraint decomposition Concurrent Engineering constraint management
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部