A Tool for Comparing Resource-Constrained Project Scheduling Problem Algorithms


Olteanu A.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Russia, 20 - 22 August 2009, pp.182-183 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Moscow
  • Country: Russia
  • Page Numbers: pp.182-183

Abstract

There are a multitude of optimization problems that are difficult to solve and for which many algorithms have been developed. One area of these problems is scheduling, where a large range of constraints need to be upheld, making the problems NP-hard. The aim of this paper is to present a tool for comparing different methods for the Resource-Constrained Project Scheduling Problem.