11 citations · 21 across the 2 of their papers we have counts for
2 papers
math.OC2014★ 11 cited
Scheduling Network Maintenance Jobs with Release Dates and Deadlines to Maximize Total Flow Over Time: Bounds and Solution Strategies
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
We consider a problem that marries network flows and scheduling, motivated by the need to schedule maintenance activities in infrastructure networks, such as rail or general logist…
cs.DS2013★ 10 cited
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
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. Maint…