LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource

Azizoğlu, Meral; Çetinkaya, Ferda Can; Pamir, Selin Kırbıyık

doi:10.1504/ejie.2015.070322

Cited by 6 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Li and Zhang (2013) considered the renewable and nonrenewable resources in an ant colony optimization algorithm to solve the resource-constrained scheduling problem. Azizoglu, Çetinkaya and Pamir (2015) developed a linear programming relaxation-based heuristic solutions algorithm implemented in a project scheduling problem with a single non-renewable resource. Altintas and Azizoglu (2020) published one of the latest papers on the multi-mode resource-constrained and discrete time-cost trade-off problem.…”

Section: Deterministic Resource-constrained Project Scheduling Problemmentioning

confidence: 99%

Optimized resource-constrained method for project schedule compression

Elkabalawy

Moselhi

2021

ECAM

View full text Add to dashboard Cite

PurposeThis paper aims to present an integrated method for optimized project duration and costs, considering the size and cost of crews assigned to project activities' execution modes.Design/methodology/approachThe proposed method utilizes fuzzy set theory (FSs) for modeling uncertainties associated with activities' duration and cost and genetic algorithm (GA) for optimizing project schedule. The method has four main modules that support two optimization methods: modeling uncertainty and defuzzification module; scheduling module; cost calculations module; and decision-support module. The first optimization method uses the elitist non-dominated sorting genetic algorithm (NSGA-II), while the second uses a dynamic weighted optimization genetic algorithm. The developed scheduling and optimization methods are coded in python as a stand-alone automated computerized tool to facilitate the developed method's application.FindingsThe developed method is applied to a numerical example to demonstrate its use and illustrate its capabilities. The method was validated using a multi-layered comparative analysis that involves performance evaluation, statistical comparisons and stability evaluation. Results indicated that NSGA-II outperformed the weighted optimization method, resulting in a better global optimum solution, which avoided local minima entrapment. Moreover, the developed method was constructed under a deterministic scenario to evaluate its performance in finding optimal solutions against the previously developed literature methods. Results showed the developed method's superiority in finding a better optimal set of solutions in a reasonable processing time.Originality/valueThe novelty of the proposed method lies in its capacity to consider resource planning and project scheduling under uncertainty simultaneously while accounting for activity splitting.

show abstract

Section: Deterministic Resource-constrained Project Scheduling Problemmentioning

confidence: 99%

Optimized resource-constrained method for project schedule compression

Elkabalawy

Moselhi

2021

ECAM

View full text Add to dashboard Cite

show abstract

“…Эта задача остается актуальной среди различных исследователей на протяжении трех десятков лет, так как ее решения могут иметь практическое применение во многих отраслях. Различают три основных категорий методов решения задачи RCPSP [1]: точные методы [2,3], эвристические методы [4][5][6] и метаэвристические [7][8][9][10][11][12][13][14]. Предложенный в данной работе генетический алгоритм можно отнести к метаэвристическим методам.…”

Section: Modified Genetic Project Planning Algorithm Implemented Withunclassified

Modified Genetic Project Planning Algorithm Implemented With the Use of Cloud Computing

Mogilev¹,

Kureichik²

2020

IZVESTIYA SFedU. ENGINEERING SCIENCES

View full text Add to dashboard Cite

“…CarlierandRinnooyKan(1982presentanalgorithmthatfindstheoptimalsolutionforthe singlemode,singlenon-renewableresourcewithprogressiveresourcearrival,projectcompletion timeproblem.Theyprovethatthisproblemissolvableinpolynomialtime,soisthesinglemode caseofourproblem. Azizoglu, Çetinkaya, and Pamir (2015) study a project scheduling problem with a single non-renewableresource,giveapureintegerprogrammingmodelanddeveloplinearprogramming relaxation-basedheuristicsolutionalgorithms.…”

Section: Introductionmentioning

confidence: 99%

A Resource Constrained Project Scheduling Problem With Multi-Modes

Altintas

Azizoğlu

2020

International Journal of Information Technology Project Management

Self Cite

View full text Add to dashboard Cite

In this study, the authors consider a project scheduling problem with a single non-renewable resource. The authors assume that the resource is released at scheduled times and specified quantities and the resource is consumed at activity completion. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. The problem is to select the modes and timings of the activities so as to minimize the project completion time. The authors give a mixed integer linear programming model and discuss some variable elimination mechanisms to enhance its efficiency.

show abstract

LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource

Cited by 6 publications

References 15 publications

Optimized resource-constrained method for project schedule compression

Optimized resource-constrained method for project schedule compression

Modified Genetic Project Planning Algorithm Implemented With the Use of Cloud Computing

A Resource Constrained Project Scheduling Problem With Multi-Modes

Contact Info

Product

Resources

About