Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26779
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | Elsevier User License | en |
dc.contributor.author | Boland, Natashia | en |
dc.contributor.author | Kalinowski, Thomas | en |
dc.contributor.author | Waterer, Hamish | en |
dc.contributor.author | Zheng, Lanbo | en |
dc.date.accessioned | 2019-04-24T02:18:17Z | - |
dc.date.available | 2019-04-24T02:18:17Z | - |
dc.date.issued | 2014-01-30 | - |
dc.identifier.citation | Discrete Applied Mathematics, 163(1), p. 34-52 | en |
dc.identifier.issn | 1872-6771 | en |
dc.identifier.issn | 0166-218X | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/26779 | - |
dc.description.abstract | 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, utilities such as water, sewerage and electricity all flow over networks. Products are manufactured and transported via supply chain networks. Such networks need regular, planned maintenance in order to continue to function. However the coordinated timing of maintenance jobs can have a major impact on the network capacity lost due to maintenance. Here we describe the background to the problem, define it, prove it is strongly NP-hard, and derive four local search-based heuristic methods. These methods integrate exact maximum flow solutions within a local search framework. The availability of both primal and dual solvers, and dual information from the maximum flow solver, is exploited to gain efficiency in the algorithms. The performance of the heuristics is evaluated on both randomly generated instances, and on instances derived from real-world data. These are compared with a state-of-the-art integer programming solver. | en |
dc.language | en | en |
dc.publisher | Elsevier BV, North-Holland | en |
dc.relation.ispartof | Discrete Applied Mathematics | en |
dc.title | Scheduling arc maintenance jobs in a network to maximize total flow over time | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1016/j.dam.2012.05.027 | en |
dcterms.accessRights | Gold | en |
local.contributor.firstname | Natashia | en |
local.contributor.firstname | Thomas | en |
local.contributor.firstname | Hamish | en |
local.contributor.firstname | Lanbo | en |
local.relation.isfundedby | ARC | en |
local.subject.for2008 | 010303 Optimisation | en |
local.subject.for2008 | 010206 Operations Research | en |
local.subject.seo2008 | 970101 Expanding Knowledge in the Mathematical Sciences | en |
dcterms.RightsStatement | https://www.elsevier.com/about/policies/open-access-licenses/elsevier-user-license | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | Natashia.Boland@newcastle.edu.au | en |
local.profile.email | tkalinow@une.edu.au | en |
local.profile.email | hamish.waterer@newcastle.edu.au | en |
local.profile.email | lanbo.zheng@newcastle.edu.au | en |
local.output.category | C1 | en |
local.grant.number | LP0990739 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.publisher.place | Netherlands | en |
local.format.startpage | 34 | en |
local.format.endpage | 52 | en |
local.identifier.scopusid | 84889096109 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 163 | en |
local.identifier.issue | 1 | en |
local.access.fulltext | Yes | en |
local.contributor.lastname | Boland | en |
local.contributor.lastname | Kalinowski | en |
local.contributor.lastname | Waterer | en |
local.contributor.lastname | Zheng | en |
dc.identifier.staff | une-id:tkalinow | en |
local.profile.orcid | 0000-0002-8444-6848 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/26779 | en |
local.date.onlineversion | 2012-07-02 | - |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | Scheduling arc maintenance jobs in a network to maximize total flow over time | en |
local.output.categorydescription | C1 Refereed Article in a Scholarly Journal | en |
local.relation.grantdescription | ARC/LP0990739 | en |
local.search.author | Boland, Natashia | en |
local.search.author | Kalinowski, Thomas | en |
local.search.author | Waterer, Hamish | en |
local.search.author | Zheng, Lanbo | en |
local.uneassociation | Unknown | en |
local.year.available | 2012 | en |
local.year.published | 2014 | en |
local.fileurl.closedpublished | https://rune.une.edu.au/web/retrieve/00608af1-5347-4eaf-8e3b-7a0281122441 | en |
local.subject.for2020 | 490304 Optimisation | en |
local.subject.for2020 | 490108 Operations research | en |
local.subject.seo2020 | 280118 Expanding knowledge in the mathematical sciences | en |
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
27
checked on Apr 6, 2024
Page view(s)
1,360
checked on Mar 9, 2023
Download(s)
2
checked on Mar 9, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.