Reference health
A Purely Proactive Scheduling Procedure for the Resource-Constrained Project Scheduling Problem with Stochastic Activity Durations
37/37 checkable references clean · checked 2026-08-28
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
8 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 37 checked references that resolve
resolves10.1016/0377-2217(93)90062-R
The project scheduling polyhedron: Dimension, facets and lifting theorems
resolves10.1016/s0377-2217(02)00758-0
Insertion techniques for static and dynamic resource-constrained project scheduling
resolves10.1016/j.ejor.2003.08.027
Executing production schedules in the face of uncertainties: A review and some future directions
resolves10.1287/opre.17.6.941
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
resolves10.1016/0166-218x(83)90012-4
Scheduling subject to resource constraints: classification and complexity
resolves10.1016/j.cor.2010.12.004
A heuristic approach for resource constrained project scheduling with uncertain activity durations
resolves10.1016/0377-2217(87)90240-2
Project scheduling with resource constraints: A branch and bound approach
resolves10.1016/j.ejor.2011.04.019
Proactive policies for the stochastic resource-constrained project scheduling problem
resolves10.1287/ijoc.1030.0043
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
resolves10.1287/mnsc.38.12.1803
A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
resolves10.1287/mnsc.43.11.1485
New Benchmark Results for the Resource-Constrained Project Scheduling Problem
resolves10.1287/opre.21.5.1114
Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
resolves10.1016/j.disopt.2007.10.003
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
resolves10.1016/s0305-0548(97)00055-5
Resource-constrained project scheduling: A survey of recent developments
resolves10.1080/00207540310001638055
Robust and reactive project scheduling: a review and classification of procedures
resolves10.1002/net.3230130103
Algorithmic approaches to preselective strategies for stochastic scheduling problems
resolves10.1002/net.3230130102
Preselective strategies for the optimization of stochastic project networks under resource constraints
resolves10.1016/s0377-2217(97)00442-6
Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
resolves10.1016/j.cor.2009.12.011
Event-based MILP models for resource-constrained project scheduling problems
resolves10.1137/0209042
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
resolves10.1137/070702928
A Sample Approximation Approach for Optimization with Probabilistic Constraints
resolves10.1007/s10107-008-0247-4
An integer programming approach for linear programs with probabilistic constraints
resolves10.1287/mnsc.44.5.714
An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
resolves10.1137/1033004
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
resolves10.1287/mnsc.16.1.93
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
resolves10.1016/j.ejor.2006.10.061
Proactive heuristic procedures for robust project scheduling: An experimental analysis
resolves10.1016/j.ijpe.2004.08.004
The use of buffers in project management: The trade-off between stability and makespan
resolves10.1080/00207540500140914
The trade-off between stability and makespan in resource-constrained project scheduling
The 8 references without a DOI — listed, not checked
no DOI — not checkedref2
no DOI — not checkedref7
no DOI — not checkedref16
no DOI — not checkedref18
no DOI — not checkedPredictable scheduling of a job shop subject to breakdowns. Robotics and Automation
no DOI — not checkedref37
no DOI — not checkedref39
no DOI — not checkedref41
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-28 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.2139/ssrn.2464056"><img src="https://citestamp.com/citestamped/10.2139/ssrn.2464056/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.2464056)