Resource allocation for robust project scheduling

Klimek, Marcin; Łebkowski, P.

doi:10.2478/v10175-011-0008-z

Cited by 11 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a review of resource allocation algorithms, the reader is referred to papers [30,32]. In this paper, the procedures are described used in computational experiments.…”

Section: Resource Allocationmentioning

confidence: 99%

Heuristics for project scheduling with discounted cash flows optimisation

Klimek¹,

Łebkowski²

2015

Bulletin of the Polish Academy of Sciences Technical Sciences

Self Cite

View full text Add to dashboard Cite

Abstract. The article presents the resource-constrained project scheduling problem with the maximisation of discounted cash flows from the contractor's perspective: with cash outflows related to starting individual activities and with cash inflows for completing project stages (milestones). The authors propose algorithms for improving a forward active schedule by iterative one-unit right shifts of activities, taking into account different resource flow networks. To illustrate the algorithms and problem, a numerical example is presented. Finally, the algorithms are tested using standard test problems with additionally defined cash flows and contractual milestones.

show abstract

“…For a review of resource allocation algorithms, the reader is referred to papers [30,32]. In this paper, the procedures are described used in computational experiments.…”

Section: Resource Allocationmentioning

confidence: 99%

Heuristics for project scheduling with discounted cash flows optimisation

Klimek¹,

Łebkowski²

2015

Bulletin of the Polish Academy of Sciences Technical Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…Resource allocation problem is most often reduced to the problem of minimising the number of additional ordering relations between tasks [23][24]. Each additional ordering constraint reduces schedule robustness.…”

Section: Proactive Schedulingmentioning

confidence: 99%

“…4 is, the reason being the lower number of additional ordering constraints. For more elaborate analyses of the problem, along with the description of algorithms used, refer to works about resource allocation in project scheduling [23,24].…”

Section: Robustness Of Schedules For Project Scheduling Problem With mentioning

confidence: 99%

Robustness of schedules for project scheduling problem with cash flow optimisation

Klimek¹,

Łebkowski

2013

Bulletin of the Polish Academy of Sciences: Technical Sciences

Self Cite

View full text Add to dashboard Cite

Abstract. The paper presents the resource-constrained project scheduling with cash flow optimisation. New project models with bonuspenalty system and payoff in stages have been proposed. For the models presented, the application of proactive scheduling is analysed, as designed to improve project execution under uncertainty. Next, schedule robustness is discussed and measures of robustness are proposed.

show abstract

“…Therefore, the smaller is the stby(a), the better the robustness of the schedule becomes [19]. Klimek and Łebkowski identified a series of criteria of evaluating resource flow network, and they compared that to the famous indicator flexibility to realize a more accurate analysis of the resource flow network [20]. Lamas and Demeulemeester developed a new procedure for generating a proactive baseline schedule for the resource-constrained project scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

Project Robust Scheduling Based on the Scattered Buffer Technology

Pang

Shi

2018

Applied Sciences

View full text Add to dashboard Cite

The research object in this paper is the sub network formed by the predecessor's affect on the solution activity. This paper is to study three types of influencing factors from the predecessors that lead to the delay of starting time of the solution activity on the longest path, and to analyze the influence degree on the delay of the solution activity's starting time from different types of factors. On this basis, through the comprehensive analysis of various factors that influence the solution activity, this paper proposes a metric that is used to evaluate the solution robustness of the project scheduling, and this metric is taken as the optimization goal. This paper also adopts the iterative process to design a scattered buffer heuristics algorithm based on the robust scheduling of the time buffer. At the same time, the resource flow network is introduced in this algorithm, using the tabu search algorithm to solve baseline scheduling. For the generation of resource flow network in the baseline scheduling, this algorithm designs a resource allocation algorithm with the maximum use of the precedence relations. Finally, the algorithm proposed in this paper and some other algorithms in previous literature are taken into the simulation experiment; under the comparative analysis, the experimental results show that the algorithm proposed in this paper is reasonable and feasible.

show abstract

Resource allocation for robust project scheduling

Cited by 11 publications

References 6 publications

Heuristics for project scheduling with discounted cash flows optimisation

Heuristics for project scheduling with discounted cash flows optimisation

Robustness of schedules for project scheduling problem with cash flow optimisation

Project Robust Scheduling Based on the Scattered Buffer Technology

Contact Info

Product

Resources

About