摘要
研究敏捷制造模式下 ,动态企业联盟的形成过程中出现的多模式资源受限项目调度问题 .与前人研究的问题有所不同 ,文中考虑了项目中每个任务对可更新 (再生 )资源需求的任意分布、可更新 (再生 )
This paper deals with the multi mode multiple resource constrained project scheduling problem (MRCPSP),which is abstracted from modeling the formation process of virtual enterprises of agile manufacturing in the next century. Different from the problem investigated by other researchers,the problem handled in this paper is of variable resource requirement and renewable resource availability constraints.As an extension to the famous DH procedure,the branch and bound algorithm in this paper can solve this kind of most general project scheduling problems with optimality.
出处
《自动化学报》
EI
CSCD
北大核心
2001年第3期387-391,共5页
Acta Automatica Sinica
基金
国家"八六三"/ CIMS跟踪项目!( 863-51 1 -984 3-0 0 8
863-51 1 -994 4-0 0 8)
广东省自然科学基金! ( 970 380 )资助项目
关键词
虚拟企业
项目优化调度算法
数学模型
Multi mode,resource constrained,project scheduling,nonpreemptive,branch and bound.