Solving Resource-constrained Multiple Project Scheduling Problem Using Timed Colored Petri Nets

To solve the resource-constrained multiple project scheduling problem （RCMPSP） more effectively, a method based on timed colored Petri net （TCPN） was proposed. In this methodology, firstly a novel mapping mechanism between traditional network diagram such as CPM （critical path method）/PERT （program...

Full description

Saved in:
Bibliographic Details
Published in:Shanghai jiao tong da xue xue bao 2009-12, Vol.14 (6), p.713-719
Main Author: 吴瑜 庄新村 宋国辉 许晓栋 李从心
Format: Article
Language:English
Subjects:
Architecture
Computer Science
Electrical Engineering
Engineering
Life Sciences
Materials Science
关键路径法
映射机制
求解
计划评审技术
调度问题
资源受限
赋时着色Petri网
项目
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To solve the resource-constrained multiple project scheduling problem （RCMPSP） more effectively, a method based on timed colored Petri net （TCPN） was proposed. In this methodology, firstly a novel mapping mechanism between traditional network diagram such as CPM （critical path method）/PERT （program evaluation and review technique） and TCPN was presented. Then a primary TCPN （PTCPN） for solving RCMPSP was modeled based on the proposed mapping mechanism. Meanwhile, the object PTCPN was used to simulate the multiple projects scheduling and to find the approximately optimal value of RCMPSP. Finally, the performance of the proposed approach for solving RCMPSP was validated by executing a mould manufacturing example.
ISSN:1007-1172
1995-8188
DOI:10.1007/s12204-009-0713-z