Predetermined intervals for start times of activities in the stochastic project scheduling problem

Bendavid, Illana; Golany, Boaz

doi:10.1007/s10479-010-0733-y

Cited by 10 publications

(4 citation statements)

References 18 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Appointment scheduling and management is a common challenge in many industries, such as truck appointments at marine terminals ( Huynh, 2009 ), production systems ( Elhafsi, 2002 ), project scheduling ( Bendavid and Golany, 2011 ), and machine scheduling ( Elmaghraby et al, 2005 ). The presented review of appointment scheduling focuses on healthcare industries to coordinate the conflict between limited medical resources and the seemingly endless demands.…”

Section: Literature Reviewmentioning

confidence: 99%

On the mass COVID-19 vaccination scheduling problem

Zhang¹,

Cao³

et al. 2022

Computers & Operations Research

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

On the mass COVID-19 vaccination scheduling problem

Zhang¹,

Cao³

et al. 2022

Computers & Operations Research

View full text Add to dashboard Cite

“…Note that we have assessed the performance of our algorithm compared to optimal elementary policies in this section, although elementary policies are not necessarily globally optimal (see Section 2.4). To the best of our knowledge, however, there are no publications in the literature that solve over a larger class of static policies with an expected makespan objective (although a limited number of studies have also looked into other than only elementary policies for other, so-called "nonregular," objectives, see for instance Buss and Rosenblatt (1997) and Bendavid and Golany (2011)).…”

Section: Comparison With Other Policiesmentioning

confidence: 99%

“…All other parameters of RCPSP, in particular the resource requirements and availabilities, are assumed to be fully known at the time of scheduling. For examples of other objective functions in stochastic project scheduling, we refer to Bendavid and Golany (2011); Bruni et al (2011); Deblaere (2010); Leus (2003); .…”

Section: Introductionmentioning

confidence: 99%

New strategies for stochastic resource-constrained project scheduling

Rostami

Creemers

Leus

2017

J Sched

View full text Add to dashboard Cite

We study the stochastic resourceconstrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a generalization of most of the classes described in the literature. A policy in this new class makes a number of a-priori decisions in a preprocessing phase while the remaining scheduling decisions are made online. A two-phase local search algorithm is proposed to optimize within the class. Our computational results show that the algorithm has been efficiently tuned towards finding high-quality solutions, and that it outperforms all existing algorithms for large instances. The results also indicate that the optimality gap even within the larger class of elementary policies is very small.

show abstract

“…Creemers, Leus, and Lambrecht [15] used a Markov process supported in a detailed division of the state space. Other solution algorithms were identified in this literature review: the cloud model [16], the Petri networks [17], the cross-entropy method [18][19], and the dependent structure matrix [20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Relative Average Deviation as Measure of Robustness in the Stochastic Project Scheduling Problem

Ortiz-Pimiento

Díaz-Serna

2019

Rev. Fac. Ing.

View full text Add to dashboard Cite

In the Project Scheduling Problem (PSP), the solution robustness can be understood as the capacity that a baseline has to support the disruptions generated by unplanned events (risks). A robust baseline of the project can be obtained from redundancy based methods, which are considered proactive methods to solve the stochastic project scheduling problem. In this research, three redundancy based methods are evaluated and their performance is compared in terms of robustness. These methods add extra time to the original activities duration in order to face the eventualities that may appear during the project execution. In this article a new indicator to analyze the solution robustness to the Project Scheduling Problem with random duration of activities is proposed. This indicator called Relative Average Deviation (RAD) is defined as the margin of deviation of the activities’ start times in relation to their durations. The RAD is based in a traditional concept that seeks to minimize the value of the differences between the planned start times and the real executed start times. The planned start times were obtained from the project baseline generated by each redundancy based method and the real executed start times were obtained from a simulation process based on Monte Carlo technique. The new indicator was used to evaluate the robustness of three baselines generated by different methods but applied to the same case study. Finally, the results suggest that the Relative Average Deviation (RAD) facilitates the interpretation of the robustness concept because it focuses on analyzing the deviation margin associated with an activity.

show abstract

Predetermined intervals for start times of activities in the stochastic project scheduling problem

Cited by 10 publications

References 18 publications

On the mass COVID-19 vaccination scheduling problem

On the mass COVID-19 vaccination scheduling problem

New strategies for stochastic resource-constrained project scheduling

Relative Average Deviation as Measure of Robustness in the Stochastic Project Scheduling Problem

Contact Info

Product

Resources

About