# Scheduling Maintenance Jobs in Networks

- Published: 30 Jan 2017

- Link this publication to...
- Cite this publication
Add to ORCID Please grant OpenAIRE to access and update your ORCID works.This research outcome is the result of merged research outcomes in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged research outcome.- add annotation

1. Bley, A., Karch, D., D'Andreagiovanni, F.: WDM fiber replacement scheduling. Electronic Notes in Discrete Mathematics 41, 189-196 (2013), http://www.sciencedirect.com/science/article/pii/S1571065313000954 [OpenAIRE]

2. Boland, N., Kalinowski, T., Kaur, S.: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. Journal of Combinatorial Optimization pp. 1-21 (2015), http://dx.doi.org/10.1007/s10878-015-9910-x

3. Boland, N., Kalinowski, T., Kaur, S.: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Computers & Operations Research 64, 113-129 (2015), http://www.sciencedirect.com/science/article/pii/S0305054815001288

4. Boland, N., Kalinowski, T., Waterer, H., Zheng, L.: Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics 163, 34-52 (2014), http://dx.doi.org/10.1016/j.dam.2012.05.027

5. Boland, N.L., Savelsbergh, M.W.P.: Optimizing the hunter valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions: Theory and Practice of Managing Risk. pp. 275-302. Springer, London (2012), http://dx.doi.org/10.1007/978-0-85729-778-5_10

6. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27(4), 993-1015 (1998), http://dx.doi.org/10.1137/S0097539795283292

###### Related research

1. Bley, A., Karch, D., D'Andreagiovanni, F.: WDM fiber replacement scheduling. Electronic Notes in Discrete Mathematics 41, 189-196 (2013), http://www.sciencedirect.com/science/article/pii/S1571065313000954 [OpenAIRE]

2. Boland, N., Kalinowski, T., Kaur, S.: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. Journal of Combinatorial Optimization pp. 1-21 (2015), http://dx.doi.org/10.1007/s10878-015-9910-x

3. Boland, N., Kalinowski, T., Kaur, S.: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Computers & Operations Research 64, 113-129 (2015), http://www.sciencedirect.com/science/article/pii/S0305054815001288

4. Boland, N., Kalinowski, T., Waterer, H., Zheng, L.: Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics 163, 34-52 (2014), http://dx.doi.org/10.1016/j.dam.2012.05.027

5. Boland, N.L., Savelsbergh, M.W.P.: Optimizing the hunter valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions: Theory and Practice of Managing Risk. pp. 275-302. Springer, London (2012), http://dx.doi.org/10.1007/978-0-85729-778-5_10

6. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27(4), 993-1015 (1998), http://dx.doi.org/10.1137/S0097539795283292