Resolution of resource conflict in a Max-Plus Linear representation-case of a single project

This research proposes a method for resolving resource conflicts in scheduling problems of a class of discrete event systems. We focus on the framework of resolving resource conflicts in the Critical Chain Project Management (CCPM), which is expressed in the form of Max-Plus Linear (MPL) system. The proposed method can detect resource conflict by checking if time-lines and workers of the internal processes overlap. If a resource conflict is detected, the process with low priority is moved up. For moving up the schedule, we define a new adjacency matrix, by which the resource conflict can be resolved.