Tabu Search and an Exact Algorithm for the Solutions of Resource-constrained Project Scheduling Problems

Omer Atli

doi:10.2991/ijcis.2011.4.2.13

Abstract

When the project is scheduled with a given set of resources, it is difficult to find the optimal solution. Resourceconstrained scheduling problems (RCPSP) are generally NP-hard. In this paper, a high level heuristic procedure “Tabu Search Algorithm (TSA)” is proposed to provide good solutions to resource-constrained, deterministic activity duration project scheduling problems. We present the application results of the computational tabu search and OPL-CPLEX algorithm and compare them with that of earlier applicable researches along with a discussion about further research. Our computational results are presented, which establish the superiority of tabu search over the existing heuristic algorithms. Two different solution strategies are also discussed, namely tabu search and OPLCPLEX exact algorithm approach which can be used with the proposed model. Due to the execution time, we have shown that OPL-CPLEX's algorithm is a valid method with medium scale RCPSPs. For the considered deterministic problems, a g...

Highlights

IntroductionProject scheduling has long been an area of intensive research, but until recently most efforts have been dedicated to developing solution procedures and generalizing model, while little work was done on generating problem instances
Project scheduling has long been an area of intensive research, but until recently most efforts have been dedicated to developing solution procedures and generalizing model, while little work was done on generating problem instances.Informally, a resource-constrained project scheduling problem (RCPSP) considers resources of limited availability and activities of known durations and resource requests, linked by precedence relations
O.Atli cope with the RCPS problems, we present a new approach based on the tabu search algorithm (TSA)

Summary

Introduction

Project scheduling has long been an area of intensive research, but until recently most efforts have been dedicated to developing solution procedures and generalizing model, while little work was done on generating problem instances. A resource-constrained project scheduling problem (RCPSP) considers resources of limited availability and activities of known durations and resource requests, linked by precedence relations. The problem consists of finding a schedule of minimal duration by assigning a start time to each activity such that precedence relations and source availabilities are respected. In this paper a mathematical model to solve Resource-Constrained Project Scheduling Problems (RCPSP), is developed. A higher level heuristic procedure “tabu search” is proposed to obtained good solutions to resource-constrained, deterministic project scheduling problems with deterministic activity duration. Most of the optimal schedules for the considered test problems have been obtained.

Objectives

Results

Conclusion