On some implementations of solving the resource constrained project scheduling problems Full article
| Journal |
Yugoslav Journal of Operations Research
ISSN: 0354-0243 , E-ISSN: 2334-6043 |
||
|---|---|---|---|
| Output data | Year: 2018, Volume: 29, Number: 1, Pages: 31-42 Pages count : 12 DOI: 10.2298/yjor171115025g | ||
| Tags | Project Management, Resource Constrained Project Scheduling Problem, Renewable Resources, Cumulative Resources, Branch and Bound Algorithms, PCPLIB. | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
We consider a resource-constrained project scheduling problem with re-
spect to the makespan minimization criterion. The problem accounts for technological
constraints of activities precedence together with resource constraints. Activities pre-
emptions 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.
Cite:
Gimadi E.K.
, Goncharov E.N.
, Mishin D.V.
On some implementations of solving the resource constrained project scheduling problems
Yugoslav Journal of Operations Research. 2018. V.29. N1. P.31-42. DOI: 10.2298/yjor171115025g Scopus OpenAlex
On some implementations of solving the resource constrained project scheduling problems
Yugoslav Journal of Operations Research. 2018. V.29. N1. P.31-42. DOI: 10.2298/yjor171115025g Scopus OpenAlex
Dates:
| Submitted: | Nov 1, 2017 |
| Accepted: | Sep 1, 2018 |
Identifiers:
| Scopus: | 2-s2.0-85062189748 |
| OpenAlex: | W2897843056 |