Preemptive resource constrained project scheduling problem with uncertain resource availabilities: Investigate worth of proactive strategies

Fallah, Mohammad Reza; Aryanezhad, Mir-Bahador; Ashtiani, Behzad

doi:10.1109/ieem.2010.5674528

Cited by 3 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Li et al (2011) and Shou et al (2015) allowed the activities to be interrupted with a maximum of one time. In Fallah et al (2010), it was assumed that access to resources was associated with uncertainty and activities could be interrupted in case of destructed resources. Zhang et al (2006) evaluated Preemptive Scheduling under Break and Resource-Constraints (PSBRC), where the activities were stopped during the break and the stopped activity could not be immediately started in the next period due to resource constraints, which must be reallocated during the break.…”

Section: Preemptive Schedulingmentioning

confidence: 99%

Resource-constrained project scheduling problem: review of past and recent developments

Habibi¹,

Barzinpour²,

Sadjadi³

2018

10.5267/j.jpm

101

View full text Add to dashboard Cite

The project scheduling problem is both practically and theoretically of paramount importance. From the practical perspective, improvement of project scheduling as a critical part of project management process can lead to successful project completion and significantly decrease of the relevant costs. From the theoretical perspective, project scheduling is regarded as one of the interesting optimization issues, which has attracted the attention of many researchers in the area of operations research. Therefore, the project scheduling issue has been significantly evaluated over time and has been developed from various aspects. In this research, the topics related to Resource-Constrained Project Scheduling Problem (RCPSP) are reviewed, recent developments in this field are evaluated, and the results are presented for future studies. In this regard, first, the standard problem of RCPSP is expressed and related developments are presented from four aspects of resources, characteristics of activities, type of objective functions, and availability level of information. Following that, details about 216 articles conducted on RCPSP during 1980-2017 are expressed. At the end, in line with the statistics obtained from the evaluation of previous articles, suggestions are made for the future studies in order to help the development of new issues in this area.

show abstract

Section: Preemptive Schedulingmentioning

confidence: 99%

Resource-constrained project scheduling problem: review of past and recent developments

Habibi¹,

Barzinpour²,

Sadjadi³

2018

10.5267/j.jpm

101

View full text Add to dashboard Cite

show abstract

“…Several studies used the same idea and proposed proactive heuristics based on slacks in different contexts. In [7], the authors investigate the use of preemption. In [12,13], the authors explored stochastic resource breakdown.…”

Section: Related Workmentioning

confidence: 99%

A proactive approach for coping with uncertain resource availabilities on desktop grids

Canon

Essafi

Trystram

2014

2014 21st International Conference on High Performance Computing (HiPC)

View full text Add to dashboard Cite

Uncertainties stemming from multiple sources affect distributed systems and jeopardize their efficient utilization. Desktop grids are especially concerned by this issue as volunteers lending their resources may have irregular and unpredictable behaviors. Efficiently exploiting the power of such systems raises theoretical issues that received little attention in the literature. In this paper, we assume that there exist predictions on the intervals during which machines are available. When these predictions have a limited error, it is possible to schedule a set of jobs such that the effective total execution time will not be higher than the predicted one. We formally prove it is the case when scheduling jobs only in large intervals and when provisioning sufficient slacks to absorb uncertainties. We present multiple heuristics with various efficiencies and costs that are empirically assessed through simulations.

show abstract

“…Numerous publications are similar to this article, proposing pro-active heuristics based on slacks. In [7], the authors investigate preemption. In [12,13], the authors explore stochastic resource breakdown.…”

Section: Scheduling Under Uncertaintiesmentioning

confidence: 99%

A Bi-Objective Scheduling Algorithm for Desktop Grids with Uncertain Resource Availabilities

Canon

Essafi

Mounié

et al. 2011

Euro-Par 2011 Parallel Processing

View full text Add to dashboard Cite

In this work, we consider the execution of applications on desktop grids. Such parallel systems use idle computing resources of desktops distributed over the Internet for running massively parallel computations. The applications are composed of workflows of independent non-preemptive sequential jobs that are submitted by successive batches. Then, the corresponding jobs are executed on the distributed available resources according to some scheduling policy. However, most resources are not continuously available over time since the users give their idle CPU time only for some time when they are not using their desktops. Moreover, even if the dates of unavailability periods are estimated in advance, they are subject to uncertainties. This may drastically impact the global performances by delaying the completion time of the applications. The aim of this paper is to study how to schedule efficiently a set of jobs in the presence of unavailability periods on identical machines. In the same time, we are interested in reducing the impact of disturbances on the unavailability periods. This is achieved by maximizing the stability that measures the distance between the makespan of the disturbed instance over the initial one. Our main contribution is the design of a new parametrized algorithm and the analysis of its performance through structural properties. This algorithm reduces the impact of disturbances on availability periods without worsening too much the makespan. Its interest is assessed by running simulations based on realistic workflows. Moreover, theoretical results are obtained under the assumption that the size of every availability interval is at least twice the size of the largest job.

show abstract

Preemptive resource constrained project scheduling problem with uncertain resource availabilities: Investigate worth of proactive strategies

Cited by 3 publications

References 14 publications

Resource-constrained project scheduling problem: review of past and recent developments

Resource-constrained project scheduling problem: review of past and recent developments

A proactive approach for coping with uncertain resource availabilities on desktop grids

A Bi-Objective Scheduling Algorithm for Desktop Grids with Uncertain Resource Availabilities

Contact Info

Product

Resources

About