Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
From MaRDI portal
Publication:2253398
DOI10.1016/j.ejor.2012.07.010zbMath1292.90189MaRDI QIDQ2253398
William A. Wallace, Burak Çavdaroğlu, Thomas C. Sharkey, Sarah G. Nurre, John E. Mitchell
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.07.010
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
90B90: Case-oriented studies in operations research
Related Items
Lateness Minimization in Pairwise Connectivity Restoration Problems, A data-driven distributionally robust approach for the optimal coupling of interdependent critical infrastructures under random failures, Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines, Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties, Learn to decompose multiobjective optimization models for large‐scale networks, Incremental network design with shortest paths, Interdependent network restoration: on the value of information-sharing, Network construction problems with due dates, Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period, Solution methodologies for debris removal in disaster response, Applying ranking and selection procedures to long-term mitigation for improved network restoration, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, Scheduling arc maintenance jobs in a network to maximize total flow over time, A computational approach to determine damage in infrastructure networks from outage reports, Incremental network design with maximum flows, Scheduling maintenance jobs in networks, Online scheduling problems with flexible release dates: applications to infrastructure restoration, Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach, A mathematical framework to optimize resilience of interdependent critical infrastructure systems under spatially localized attacks, An adaptive robust framework for the optimization of the resilience of interdependent infrastructures under natural hazards, Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, Tree optimization based heuristics and metaheuristics in network construction problems, Interdependent integrated network design and scheduling problems with movement of machines, Exploring recovery strategies for optimal interdependent infrastructure network resilience, Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks, Network construction/restoration problems: cycles and complexity, Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem, Integrating location and network restoration decisions in relief networks under uncertainty, Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems, A linear input dependence model for interdependent networks, Incremental Network Design with Minimum Spanning Trees, The Post-Disaster Debris Clearance Problem Under Incomplete Information, Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Strategic network restoration
- A time indexed formulation of non-preemptive single machine scheduling problems
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A polyhedral approach to single-machine scheduling problems.
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
- Using mixed-integer programming to solve power grid blackout problems
- Efficient recovery from power outage (extended abstract)
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
- Solving Project Scheduling Problems by Minimum Cut Computations
- Single-Machine Scheduling with Precedence Constraints
- Scheduling
