Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:0
  • preuzimanja u poslednjih 30 dana:0
članak: 2 od 9  
Back povratak na rezultate
Yugoslav Journal of Operations Research
2019, vol. 29, br. 1, str. 31-42
jezik rada: engleski
vrsta rada: neklasifikovan
objavljeno: 28/02/2019
doi: 10.2298/YJOR171115025G
On some implementations of solving the resource constrained project scheduling problems
(naslov ne postoji na srpskom)
aSobolev Institute of Mathematics, Novosibirsk, Russia + Novosibirsk State University, Novosibirsk, Russia
bSobolev Institute of Mathematics, Novosibirsk, Russia

e-adresa: gimadi@math.nsc.ru, gon@math.nsc.ru, mishindmv@gma

Projekat

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)

Sažetak

(ne postoji na srpskom)
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.

Ključne reči

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