Flexible resource-constrained resource leveling project scheduling problem

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS(2010)

引用 8|浏览4
暂无评分
摘要
To resolve highly-effective utilization of flexible resources for One-of-a-Kind Production (OKP) enterprises,a flexible resource-constrainted resource leveling project scheduling problem was proposed. Flexible resource model based on two levels mapping network was designed to represent relationships among tasks, capability and resources. Consequently its mathematical model was constructed. To resolve the model, a Path Relinking (PR) algorithm which was based on an Adaptive Serial Schedule Generation Scheme (ASSGS) and a Maximum network flow-based Flexible Resource Assignment Model (MFRAM) was presented. ASSGS adopted Serial Schedule Generation Scheme (SSGS) aiming to generate a schedule which was more beneficial to resource leveling. MFRAM was used to represent relationship among tasks, capability and resources. It effectively resolved the flexible resource assignment problem. Comprehensive computational experiments were performed on adapted standard project sets in PSPLIB. Experimental results revealed the high solution quality and better time performance of the method.
更多
查看译文
关键词
Mathematical models,Maximum network flow,One-of-a-kind production,Path relinking algorithm,Project scheduling,Resource constraints
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要