Title

Meta-Raps Approach For Solving The Resource Allocation Problem

Keywords

Computer heuristic; PSPLIB; Resource allocation problem

Abstract

Project scheduling is an important planning function that involves scheduling activities of a project such that the total completion time for the entire project is minimized. In performing this function, one is often faced with the problem of limited resources in addition to considering the time element and precedence constraints of the project. The task of allocation of limited resources to competing activities further complicates the project scheduling procedure. Because of the fact that the Resource Allocation Problem is a very known and well-studied combinatorial problem, a number of heuristic rules can be found in literature. In this paper, authors present a new approach, Meta-RaPS, which stands for 'Metaheuristic for Randomized Priority Search', to address this combinatorial problem. This article will show experimental results using the Meta-RaPS approach on several well-known Resource Constrained Project Scheduling Problem test sets.

Publication Date

12-1-2002

Publication Title

Robotics, Automation, Control and Manufacturing: Trends, Principles and Applications - Proceedings of the 5th Biannual World Automation Congress, WAC 2002, ISORA 2002, ISIAC 2002 and ISOMA 2002

Volume

14

Number of Pages

103-108

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

78650229345 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/78650229345

This document is currently not available here.

Share

COinS