Scheduling Timed Marked Graphs with Resources: A Serial Method

Abstract We study a scheduling problem based on marked graph with resource constraints (MGR). This class of Petri nets is obtained by merging marked graph sub-nets with mutual exclusion sub-nets. MGR can defme very general problems since the Resource-Constrained Project Scheduling Problems can be easily model with a MGR. As consequence the MGR scheduling problem is strongly NP-hard. We propose a serial method for building a fmite schedule. This method frrst computes indicators on tasks without resource constraints. Those values are then used by a dispatching rule while playing the token game