Prsp-Aco

IMPLEMENTATION OF ANT COLONY OPTIMIZATION ALGORITHM ON THE PROJECT RESOURCE SCHEDULING PROBLEM

Aruna A. Priyanto1, Adiwijaya2, W. Maharani3

1,3Faculty of Informatics, Institute of Technology Telkom

2Faculty of Science, Institute of Technology Telkom

1Runrun87@gmail.com, 2adw@ittelkom.ac.id, 3wrh@ittelkom.ic.id

Abstract

Project management in the business field is defined as managing and directing time, material, personnel, and costs to complete a particular project. One important phase in the project planning is Project Resource Scheduling. This process identifies resources amount and type according to the activity that scheduled. Planning the efficient use of resources is a complex task. The purpose is to create a smoother distribution of resource usage i.e. to minimize the fluctuation of the resource usage. The resource leveling is used to produce a solution to the problem. So far, researchers test several heuristic in order to produce the optimal solutions of the problem. In this paper, we discuss an implementation of the Ant Colony Optimization (ACO) to the Project Resource Scheduling Problem (PRSP). The effectiveness of this heuristic is demonstrated with case studies. Preliminary test shows that this approach can give a good solution with minimal fluctuation.

Keyword : Project Resource Scheduling Problem, fluctuation, resource leveling, ACO

1.

2. Introduction

The Project Resource Scheduling Problem (PRSP) is to find a feasible schedule with minimal fluctuation for a given project with resource constraints within fixed deadline of the project. Then we assumed that resource is unlimited. Project involves either one resource or more.

Resource leveling is a procedure that can be used for PRSP whether or not resources are constrained. If the network is not too large and there are only a few resources, the leveling process can be done manually. For larger networks and multiple resources, resource leveling becomes extremely complex,...