Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results

We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning p...

متن کامل

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results

We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning p...

متن کامل

Scheduling arc maintenance jobs in a network to maximize total flow over time

We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures critical to modern life. For example, util...

متن کامل

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

We study the problem of scheduling maintenance on arcs of a capacitated network so as to maximize the total flow from a source node to a sink node over a set of time periods. Maintenance on an arc shuts down the arc for the duration of the period in which its maintenance is scheduled, making its capacity zero for that period. A set of arcs is designated to have maintenance during the planning p...

متن کامل

Scheduling arc maintenance jobs in a network to maximize total flow over time ∗ Natashia Boland Thomas Kalinowski Hamish Waterer Lanbo Zheng

We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures critical to modern life. For example, util...

متن کامل

Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results

نویسندگان

چکیده

منابع مشابه