Modeling and Solving Project Scheduling with Calendars

Kreter, Stefan; Schutt, Andreas; Stuckey, Peter J.

doi:10.1007/978-3-319-23219-5_19

Cited by 7 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, Resource disruption, as a special category of resource uncertainty, few studies deal with it. Examples of those who do are Zhu et al (2005), Lambrechts et al (2011), Chakrabortty et al (2016Chakrabortty et al ( , 2018, Chand et al (2019), Deblaere et al (2011), Drezet and Billaut (2008) and Kreter et al (2015Kreter et al ( , 2016Kreter et al ( , 2017. Even fewer studies considered stochastic/dynamic resource disruptions in project scheduling.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Deblaere et al (2011) proposed some exact reactive scheduling procedures and tabu search algorithms to repair project interruptions. Kreter et al (2015Kreter et al ( , 2016Kreter et al ( , 2017 developed constraint programming (CP) to consider the RCPSP with general temporal and calendar constraints. Calendar constraints refer to the unavailability of necessary resources on certain days during Dynamic resource disruption the scheduling planning period that results in the delay in the execution of activities.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption

Bai

2023

View full text Add to dashboard Cite

PurposeThis paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.Design/methodology/approachThis paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.FindingsThe results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.Originality/valueThe paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption

Bai

2023

View full text Add to dashboard Cite

show abstract

“…The most effective methods make use of hybrid approaches that combine the effectiveness of modern SAT solvers with other solving techniques such as Finite Domain propagation or Linear Programming [17,31,32]. To the best of our knowledge, the LCG approach gives the best results for RCPSP [32] and variants like RCPSP/max [33] and RCPSP/max-cal [24].…”

Section: Rcpspmentioning

confidence: 99%

Parallelizing Constraint Solvers for Hard RCPSP Instances

Amadini

Gabbrielli

Mauro

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Resource-Constrained Project Scheduling Problem (RCPSP) is a well-known scheduling problem aimed at minimizing the makespan of a project subject to temporal and resource constraints. Constraint Programming allows to model and solve RCPSPs in a natural and efficient way, especially when Lazy Clause Generation (LCG) techniques are employed. In this paper we show that hard RCPSPs can be efficiently tackled by a portfolio approach that combines the strengths of different-not necessarily LCG-based-solvers by exploiting their parallel execution on multiple cores. Our approach seeks to predict and run the best solvers for a new, unseen RCPSP instance and also enables the bounds communication between them. This on-average allows to outperform the oracle solver that always chooses the best available solver for any given instance.

show abstract

“…RCPSP has been addressed by both exact methods [22,30,32,36], as well as heuristic methods [19,21]. Due to the vast amount of literature, we will focus on CP/OR-methods most closely related to the work of this paper.…”

Section: Introductionmentioning

confidence: 99%

“…From the angle of RCPSP, global resources can be expressed as renewable resources which are available with exactly one unit per timestep and can therefore only be consumed by a single job per timestep. RCPSP has been addressed by both exact methods [22,30,32,36], as well as heuristic methods [19,21]. Due to the vast amount of literature, we will focus on CP/OR-methods most closely related to the work of this paper.…”

mentioning

confidence: 99%

Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems

Mossige

Gotlieb

Spieker

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Testing cyber-physical systems involves the execution of test cases on target-machines equipped with the latest release of a software control system. When testing industrial robots, it is common that the target machines need to share some common resources, e.g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources. With a large number of such tests executed on a regular basis, this scheduling becomes difficult to manage manually. In fact, with manual test execution planning and scheduling, some robots may remain unoccupied for long periods of time and some test cases may not be executed. This paper introduces TC-Sched, a time-aware method for automated test case execution scheduling. TC-Sched uses Constraint Programming to schedule tests to run on multiple machines constrained by the tests' access to shared resources, such as measurement or networking devices. The CP model is written in SICStus Prolog and uses the Cumulatives global constraint. Given a set of test cases, a set of machines, and a set of shared resources, TC-Sched produces an execution schedule where each test is executed once with minimal time between when a source code change is committed and the test results are reported to the developer. Experiments reveal that TC-Sched can schedule 500 test cases over 100 machines in less than 4 minutes for 99.5% of the instances. In addition, TC-Sched largely outperforms simpler methods based on a greedy algorithm and is suitable for deployment on industrial robot testing.

show abstract

Modeling and Solving Project Scheduling with Calendars

Cited by 7 publications

References 16 publications

A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption

A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption

Parallelizing Constraint Solvers for Hard RCPSP Instances

Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems

Contact Info

Product

Resources

About