A Tool for Comparing Resource-Constrained Project Scheduling Problem Algorithms

Olteanu A.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Rusya, 20 - 22 Ağustos 2009, ss.182-183 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Moscow
  • Basıldığı Ülke: Rusya
  • Sayfa Sayıları: ss.182-183


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.