We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This study investigates scheduling strategies for the stochastic resource-constrained project scheduling problem with maximal time lags (SRCPSP/max)). Recent advances in Constraint Programming (CP) and Temporal Networks have reinvoked interest in evaluating the advantages and drawbacks of various proactive and reactive scheduling methods. First, we present a new, CP-based fully proactive method. Second, we show how a reactive approach can be constructed using an online rescheduling procedure. A third contribution is based on partial order schedules and uses Simple Temporal Networks with Uncertainty (STNUs). Our statistical analysis shows that the STNU-based algorithm performs best in terms of solution quality, while also showing good relative offline and online computation time.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2409.09107")
get_code_for_paper("2409.09107")
have("2409.09107")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2409.09107.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2409.09107)
Connect an agent — have() is free.