Optimal crashing of an activity network with disruptions

DOI10.1007/s10107-021-01670-xzbMath1495.90121OpenAlexW3176061223MaRDI QIDQ2149579

Haoxiang Yang, David P. 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

zbMATH Keywords

project crashingspatial branch-and-cutstochastic disruptionstwo-stage stochastic mixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Decomposition methods (49M27)

Uses Software

• Gurobi
• RanGen
• JuMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
• 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
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
• Operating room planning and scheduling: a literature review
• Scheduling subject to resource constraints: Classification and complexity
• A multicut algorithm for two-stage stochastic linear programs
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Sample-path optimization of convex stochastic performance functions
• Linear preselective policies for stochastic project scheduling
• Project scheduling. A research handbook.
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation
• Decision-dependent probabilities in stochastic programs with recourse
• MIDAS: a mixed integer dynamic approximation scheme
• Stochastic dual dynamic integer programming
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• Rangen: A random network generator for activity-on-the-node networks
• A Network Flow Computation for Project Cost Curves
• Scheduling job shop problems with sequence-dependent setup times
• Feasibility-Based Bounds Tightening via Fixed Points
• Critical-Path Planning and Scheduling: Mathematical Basis
• A Linear Decision-Based Approximation Approach to Stochastic Programming
• The stochastic time–cost tradeoff problem: A robust optimization approach
• Lectures on Stochastic Programming
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem
• Application of a Technique for Research and Development Program Evaluation
• Distributionally robust project crashing with partial or no correlation information
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Optimal crashing of an activity network with disruptions