TITLE:
Resolution of Resource Contentions in the CCPM-MPL Using Simulated Annealing and Genetic Algorithm
AUTHORS:
Hajime Yokoyama, Hiroyuki Goto
KEYWORDS:
Critical Chain Project Management, Max-Plus Algebra, CCPM-MPL, Simulated Annealing, Genetic Algorithm
JOURNAL NAME:
American Journal of Operations Research,
Vol.6 No.6,
November
21,
2016
ABSTRACT: This research aims to plan a “good-enough” schedule with leveling of resource contentions. We use the existing critical chain project management-max-plus linear framework. Critical chain project management is known as a technique used to both shorten the makespan and observe the due date under limited resources; the max-plus linear representation is an approach for modeling discrete event systems as production systems and project scheduling. If a contention arises within a single resource, we must resolve it by appending precedence relations. Thus, the resolution framework is reduced to a combinatorial optimization. If we aim to obtain the exact optimal solution, the maximum computation time is longer than 10 hours for 20 jobs. We thus experiment with Simulated Annealing (SA) and Genetic Algorithm (GA) to obtain an approximate solution within a practical time. Comparing the two methods, the former was beneficial in computation time, whereas the latter was better in terms of the performance of the solution. If the number of tasks is 50, the solution using SA is better than that using GA.