Yugoslav Journal of Operations Research
how to cite this article
share this article


  • citations in SCIndeks: 0
  • citations in CrossRef:0
  • citations in Google Scholar:[]
  • visits in previous 30 days:1
  • full-text downloads in 30 days:0


article: 1 from 1  
Back back to result list
2019, vol. 29, iss. 1, pp. 31-42
On some implementations of solving the resource constrained project scheduling problems
aSobolev Institute of Mathematics, Novosibirsk, Russia + Novosibirsk State University, Novosibirsk, Russia
bSobolev Institute of Mathematics, Novosibirsk, Russia,, mishindmv@gma
Project of the Russian Foundation for Basic Research (project no. 16-07-00829)
Project of the Russian Ministry of Science and Education (project no. 0314-2016-0014)
Project of the Russian Foundation (project 16-11-10041)

Keywords: Project Management; Resource Constrained Project Scheduling Problem; Renewable Resources; Cumulative Resources; Branch and Bound Algorithms; PCPLIB
We consider a resource-constrained project scheduling problem with respect to the make span 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.


article language: English
document type: unclassified
DOI: 10.2298/YJOR171115025G
published in SCIndeks: 28/02/2019

Related records

No related records