A note on the paper by M. A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource-constrained project scheduling

Kobylanski, Przemyslaw; Kuchta, Dorota

doi:10.1016/j.ijpe.2006.07.012

Cited by 44 publications

(34 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors proposed the total sum of the free slacks as the measure of robustness and presented a biobjective model that maximizes robustness along with minimization of makespan. Kobyalanksy and Kutcha [111] proposed a modification on the mentioned model and established that a robust schedule is that which maximizes the free slack/activity duration ratio. Chtourou and Haouari [112] proposed 12 different robustness measures based on activity slack.…”

Section: Robustnessmentioning

confidence: 99%

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Chen¹,

Liang

Padilla

2014

Entropy

View full text Add to dashboard Cite

Abstract:Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP), a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC)-an effective and powerful meta-heuristic-to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined OPEN ACCESSEntropy 2014, 16 5033 previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every benchmark set. And, in an attempt to solve larger instances with 50 or 100 activities, we also used the MRCPSP/max benchmark sets, where the increase of the makespan is approximately 35% with respect to the best known solutions at the same time as with a 20% increase in robustness.

show abstract

Section: Robustnessmentioning

confidence: 99%

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Chen¹,

Liang

Padilla

2014

Entropy

View full text Add to dashboard Cite

show abstract

“…Depending on the type of robustness being analysed, robustness measures used in the research may be divided into quality robustness measures and solution robustness measures [25].…”

Section: Measures Of Robustnessmentioning

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

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

“…The even distribution of buffers throughout the schedule is striven at (the idea akin to the one proposed by Kobylański and Kuchta (2007). For instance (the importance of instability cost for a given activity having been neglected): an increase in the time buffer bB i before an activity for which bB i = 0 instead of before an activity for which bB i = 2, increases the value of the objective function by the factor of 3 a .…”

Section: Buffer Allocation Algorithm For the Problem Of Timely Milestmentioning

confidence: 99%

“…In numerous survey papers (Aytug et al, 2005;Herroelen and Leus, 2004;Klimek and Łebkowski, 2007;Van De Vonder, 2006;Vieira et al, 2003), the authors have attempted to structure the research in project scheduling under uncertain conditions. Project scheduling most often includes an analysis of uncertainty pertaining to the activity duration time (Herroelen and Leus, 2004;Kobylański and Kuchta, 2007;Lambrechts et al, 2006;Leus, 2003;Van de Vonder et al, 2005;Van de Vonder et al, 2006;Van De Vonder, 2006). It is assumed that numerous other disturbances (including adverse weather conditions, resource unavailability, irregularities in material supplies etc.)…”

Section: Introductionmentioning

confidence: 99%

“…-algorithms using information on Fixed Relative Deviation (FRD) (Herroelen and Leus, 2004;Leus, 2003;Van de Vonder et al, 2005;Van de Vonder et al, 2006), -algorithms using information on weights attached to activities and arrangementrelated relations among activities: Resource Flow Dependent Float Factor (RFDFF) and RFDFF+ (Herroelen and Leus, 2004;Leus, 2003 (Kobylański and Kuchta, 2007).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones

Klimek

Łebkowski

2009

dmms

View full text Add to dashboard Cite

Abstract. The paper discusses the problem of robust buffer allocation for ResourceConstrained Project Scheduling Problem (RCPSP) with predefined milestones 1 , for which execution deadlines have been established. To solve the problem, an algorithm is proposed supporting insertion of unit time buffers, with the simultaneous maximisation of new metrics of arrangement robustness. The presented results of experimental research speak for usability of the solutions proposed. The effectiveness is studied with use of test tasks 2 included in the Project Scheduling Problem Library (PSPLIB) with additionally specified project milestones.

show abstract

A note on the paper by M. A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource-constrained project scheduling

Cited by 44 publications

References 4 publications

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules

Robustness of schedules for project scheduling problem with cash flow optimisation

Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones

Contact Info

Product

Resources

About