On the public citation graph

Pareto Efficiency in the Two-stage Adaptive Robust Resource-constrained Project Scheduling Problem

https://doi.org/10.2139/ssrn.7347358
0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580665openalex-snapshot
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
inferredcites →https://doi.org/10.1007/s10107-004-0512-0openalex-snapshot
On the generation of circuits and minimal forbidden sets
inferredcites →https://doi.org/10.1007/s10107-023-01983-zopenalex-snapshot
Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens
inferredcites →https://doi.org/10.1007/s10479-023-05537-6openalex-snapshot
Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP
inferredcites →https://doi.org/10.1007/s10696-012-9147-2openalex-snapshot
Robust optimization for resource-constrained project scheduling with uncertain activity durations
inferredcites →https://doi.org/10.1007/s10951-007-0011-2openalex-snapshot
A classification of predictive-reactive project scheduling procedures
inferredcites →https://doi.org/10.1007/s10951-015-0421-5openalex-snapshot
Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
inferredcites →https://doi.org/10.1016/0377-2217(93)90062-ropenalex-snapshot
The project scheduling polyhedron: Dimension, facets and lifting theorems
inferredcites →https://doi.org/10.1016/j.cie.2006.10.002openalex-snapshot
Heuristic Procedures for Reactive Project Scheduling
inferredcites →https://doi.org/10.1016/j.cie.2007.11.017openalex-snapshot
A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling
inferredcites →https://doi.org/10.1016/j.cor.2018.06.016openalex-snapshot
A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem
inferredcites →https://doi.org/10.1016/j.cor.2021.105232openalex-snapshot
A compact reformulation of the two-stage robust resource-constrained project scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2006.10.061openalex-snapshot
Proactive heuristic procedures for robust project scheduling: An experimental analysis
inferredcites →https://doi.org/10.1016/j.ejor.2019.09.052openalex-snapshot
A robust optimization approach for the multi-mode resource-constrained project scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2021.02.034openalex-snapshot
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
inferredcites →https://doi.org/10.1016/j.ijpe.2004.08.004openalex-snapshot
The use of buffers in project management: The trade-off between stability and makespan
inferredcites →https://doi.org/10.1016/j.omega.2014.12.006openalex-snapshot
A practical guide to robust optimization
inferredcites →https://doi.org/10.1016/j.omega.2016.09.009openalex-snapshot
An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations
inferredcites →https://doi.org/10.1016/j.orl.2013.05.003openalex-snapshot
Solving two-stage robust optimization problems using a column-and-constraint generation method
inferredcites →https://doi.org/10.1016/j.orl.2022.08.003openalex-snapshot
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem
inferredcites →https://doi.org/10.1016/s0377-2217(96)00170-1openalex-snapshot
PSPLIB - A project scheduling problem library
inferredcites →https://doi.org/10.1023/a:1022283403119openalex-snapshot
RanGen: A Random Network Generator for Activity-on-the-Node Networks
inferredcites →https://doi.org/10.1287/mnsc.2013.1753openalex-snapshot
Pareto Efficiency in Robust Optimization
inferredcites →https://doi.org/10.1287/opre.1030.0065openalex-snapshot
The Price of Robustness
inferredcites →https://doi.org/10.1504/ijsoi.2009.023421openalex-snapshot
A robust optimisation approach to project scheduling and resource allocation
inferredcites →https://doi.org/10.1515/9781400831050openalex-snapshot
Robust Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.