On some implementations of solving the resource constrained project scheduling problems

Standard

On some implementations of solving the resource constrained project scheduling problems. / Gimadi, E. Kh ; Goncharov, E. N.; Mishin, D. V.

In: Yugoslav Journal of Operations Research, Vol. 29, No. 1, 01.01.2019, p. 31-42.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{49de4d61a9a84958af3575e0d0270365,

title = "On some implementations of solving the resource constrained project scheduling problems",

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.",

keywords = "Branch and Bound Algorithms, Cumulative Resources, PCPLIB, Project Management, Renewable Resources, Resource Constrained Project Scheduling Problem",

author = "Gimadi, {E. Kh} and Goncharov, {E. N.} and Mishin, {D. V.}",

year = "2019",

month = jan,

day = "1",

doi = "10.2298/YJOR171115025G",

language = "English",

volume = "29",

pages = "31--42",

journal = "Yugoslav Journal of Operations Research",

issn = "0354-0243",

publisher = "University of Belgrade",

number = "1",

}

RIS

TY - JOUR

T1 - On some implementations of solving the resource constrained project scheduling problems

AU - Gimadi, E. Kh

AU - Goncharov, E. N.

AU - Mishin, D. V.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Branch and Bound Algorithms

KW - Cumulative Resources

KW - PCPLIB

KW - Project Management

KW - Renewable Resources

KW - Resource Constrained Project Scheduling Problem

UR - http://www.scopus.com/inward/record.url?scp=85062189748&partnerID=8YFLogxK

UR - https://elibrary.ru/item.asp?id=38693423

U2 - 10.2298/YJOR171115025G

DO - 10.2298/YJOR171115025G

M3 - Article

AN - SCOPUS:85062189748

VL - 29

SP - 31

EP - 42

JO - Yugoslav Journal of Operations Research

JF - Yugoslav Journal of Operations Research

SN - 0354-0243

IS - 1

ER -

ID: 18679058