Optimal crashing of an activity network with disruptions
From MaRDI portal
Publication:2149579
DOI10.1007/S10107-021-01670-XzbMATH Open1495.90121OpenAlexW3176061223MaRDI QIDQ2149579FDOQ2149579
Authors: Haoxiang Yang, David Morton 
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01670-x
Recommendations
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
- Distributionally robust project crashing with partial or no correlation information
- Disruption management for resource-constrained project scheduling
- An adaptive crashing policy for stochastic time-cost tradeoff problems
- Project crashing in the presence of general non-linear activity time reduction costs
project crashingspatial branch-and-cutstochastic disruptionstwo-stage stochastic mixed integer programming
Cites Work
- JuMP: a modeling language for mathematical optimization
- Title not available (Why is that?)
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A multicut algorithm for two-stage stochastic linear programs
- Lectures on Stochastic Programming
- Title not available (Why is that?)
- Operating room planning and scheduling: a literature review
- Scheduling subject to resource constraints: Classification and complexity
- Project scheduling. A research handbook.
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Rangen: A random network generator for activity-on-the-node networks
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- Title not available (Why is that?)
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Title not available (Why is that?)
- A network flow computation for project cost curves
- Scheduling job shop problems with sequence-dependent setup times
- Critical-Path Planning and Scheduling: Mathematical Basis
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Application of a technique for research and development program evaluation
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Sample-path optimization of convex stochastic performance functions
- Linear preselective policies for stochastic project scheduling
- Feasibility-based bounds tightening via fixed points
- Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
- The stochastic time–cost tradeoff problem: A robust optimization approach
- Title not available (Why is that?)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
- Robust resource allocations in temporal networks
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
- Stochastic dual dynamic integer programming
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
- Decision-dependent probabilities in stochastic programs with recourse
- MIDAS: a mixed integer dynamic approximation scheme
- Batching-based approaches for optimized packing of jobs in the spatial scheduling problem
- Distributionally robust project crashing with partial or no correlation information
Cited In (3)
Uses Software
This page was built for publication: Optimal crashing of an activity network with disruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149579)
