Network construction problems with due dates

DOI10.1016/j.ejor.2015.02.014zbMath1346.90322OpenAlexW2072770236MaRDI QIDQ319443

Igor Averbakh, Jordi Pereira

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.02.014

zbMATH Keywords

schedulingnetwork designemergency restorationintegrated network design and schedulingnetwork construction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach ⋮ Solution methodologies for debris removal in disaster response ⋮ Network construction/restoration problems: cycles and complexity ⋮ Solving real-size stochastic railway rapid transit network construction scheduling problems ⋮ Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines ⋮ Incremental Network Design with Minimum Spanning Trees ⋮ Lateness Minimization in Pairwise Connectivity Restoration Problems ⋮ Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling ⋮ Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ Interdependent integrated network design and scheduling problems with movement of machines ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ The incremental connected facility location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Incremental network design with shortest paths
• Emergency path restoration problems
• Incremental network design with maximum flows
• Complexity results for scheduling chains on a single machine
• A time indexed formulation of non-preemptive 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
• Efficient recovery from power outage (extended abstract)
• An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
• Incremental Network Design with Minimum Spanning Trees
• The Delivery Man Problem and Cumulative Matroids
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• An algorithm for the steiner problem in graphs

This page was built for publication: Network construction problems with due dates