Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming

DOI10.1016/j.ejor.2015.04.015zbMath1346.90405OpenAlexW2007617565MaRDI QIDQ319710

Norman Keith Womer, Hai-Tao Li

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.015

zbMATH Keywords

simulationstochastic schedulingresource-constrained project schedulingapproximate dynamic programminguncertain task durations

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items (20)

New strategies for stochastic resource-constrained project scheduling ⋮ Stochastic optimization for vaccine and testing kit allocation for the COVID-19 pandemic ⋮ An evolutionary approach for resource constrained project scheduling with uncertain changes ⋮ A compact reformulation of the two-stage robust resource-constrained project scheduling problem ⋮ Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization ⋮ Meso-parametric value function approximation for dynamic customer acceptances in delivery routing ⋮ A two‐layer approach for solving robust decentralized multiproject scheduling problem with multi‐skilled staff ⋮ A lexicographic approach to the robust resource-constrained project scheduling problem ⋮ Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem ⋮ Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems ⋮ An approximate dynamic programming approach to project scheduling with uncertain resource availabilities ⋮ A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea ⋮ An effective heuristic for project scheduling with resource availability cost ⋮ Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution ⋮ Efficient priority rules for the stochastic resource-constrained project scheduling problem ⋮ Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties ⋮ A robust optimization approach for the multi-mode resource-constrained project scheduling problem ⋮ Stochastic project scheduling with hierarchical alternatives ⋮ Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing ⋮ Immediate schedule adjustment and semidefinite relaxation

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing
• A heuristic approach for resource constrained project scheduling with uncertain activity durations
• Scheduling and constraint propagation
• When it is worthwhile to work with the stochastic RCPSP?
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• The art and theory of dynamic programming
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• PSPLIB -- a project scheduling problem library
• Using tabu search to schedule activities of stochastic resource-constrained projects
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Linear preselective policies for stochastic project scheduling
• Project scheduling. A research handbook.
• Rollout algorithms for stochastic scheduling problems
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• Proactive policies for the stochastic resource-constrained project scheduling problem
• Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem
• Rollout algorithms for combinatorial optimization
• Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
• Determining the K Most Critical Paths in PERT Networks
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Orthogonal Array-Based Latin Hypercubes
• A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Application of a Technique for Research and Development Program Evaluation
• Approximate Dynamic Programming
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming