On some implementations of solving the resource constrained project scheduling problems

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities preemptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.

Original languageEnglish
Pages (from-to)31-42
Number of pages12
JournalYugoslav Journal of Operations Research
Volume29
Issue number1
DOIs
Publication statusPublished - 1 Jan 2019

Keywords

  • Branch and Bound Algorithms
  • Cumulative Resources
  • PCPLIB
  • Project Management
  • Renewable Resources
  • Resource Constrained Project Scheduling Problem

Fingerprint Dive into the research topics of 'On some implementations of solving the resource constrained project scheduling problems'. Together they form a unique fingerprint.

  • Cite this