Network construction problems with due dates

DOI10.1016/J.EJOR.2015.02.014MaRDI QIDQ319443zbMATH OpenOpenAlexFDO

Authors 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

emergency restorationintegrated network design and schedulingnetwork constructionnetwork designscheduling

Mathematics Subject Classification ID

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

Recommendations

• Network scheduling techniques for construction project management
• Scheduling of project networks
• Networks with delays
• Network construction/restoration problems: cycles and complexity
• Network construction with ordered constraints
• Network planning problems in telecommunications
• Network design for time‐constrained delivery
• scientific article; zbMATH DE number 4135692
• Task Scheduling in Networks

Cites work

• A time indexed formulation of non-preemptive single machine scheduling problems
• An algorithm for the steiner problem in graphs
• An experimental study of LP-based approximation algorithms for scheduling problems
• Complexity results for scheduling chains on a single machine
• Efficient recovery from power outage (extended abstract)
• Emergency path restoration problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Incremental network design with maximum flows
• Incremental network design with minimum spanning trees
• Incremental network design with shortest paths
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• Scheduling algorithms
• The Delivery Man Problem and Cumulative Matroids

Cited in

(18)

• Network scheduling techniques for construction project management
• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
• 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
• Network construction/restoration problems: cycles and complexity
• Integrating location and network restoration decisions in relief networks under uncertainty
• The incremental connected facility location problem
• Solving real-size stochastic railway rapid transit network construction scheduling problems
• The pairwise flowtime network construction problem
• Incremental network design with minimum spanning trees
• Quantitative models for infrastructure restoration after extreme events: network optimization meets scheduling
• Solution methodologies for debris removal in disaster response
• Minimizing the makespan in multiserver network restoration problems
• Lateness minimization in pairwise connectivity restoration problems
• Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
• Note on polynomial-time approximation schemes for integrated network design and scheduling problems
• Exact solution approaches for the multi-period degree constrained minimum spanning tree problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319443)