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 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.