1. Research UNE
  2. UNE
  3. Journal Article
Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/26795
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBoland, Natashiaen
dc.contributor.authorKalinowski, Thomasen
dc.contributor.authorKaur, Simranjiten
dc.date.accessioned2019-04-26T02:24:09Z-
dc.date.available2019-04-26T02:24:09Z-
dc.date.issued2016-10-
dc.identifier.citationJournal of Combinatorial Optimization, 32(3), p. 885-905en
dc.identifier.issn1573-2886en
dc.identifier.issn1382-6905en
dc.identifier.urihttps://hdl.handle.net/1959.11/26795-
dc.description.abstractWe 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 period, which will require each to be shut down for exactly one time period. In general this problem is known to be NP-hard, and several special instance classes have been studied. Here we propose an additional constraint which limits the number of maintenance jobs per time period, and we study the impact of this on the complexity.en
dc.languageenen
dc.publisherSpringer New York LLCen
dc.relation.ispartofJournal of Combinatorial Optimizationen
dc.titleScheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time perioden
dc.typeJournal Articleen
dc.identifier.doi10.1007/s10878-015-9910-xen
local.contributor.firstnameNatashiaen
local.contributor.firstnameThomasen
local.contributor.firstnameSimranjiten
local.relation.isfundedbyARCen
local.subject.for2008010303 Optimisationen
local.subject.for2008010206 Operations Researchen
local.subject.seo2008970101 Expanding Knowledge in the Mathematical Sciencesen
local.profile.schoolSchool of Science and Technologyen
local.profile.emailtkalinow@une.edu.auen
local.output.categoryC1en
local.grant.numberLP0990739en
local.grant.numberLP1102000524en
local.grant.numberHVCCC P/Len
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.publisher.placeUnited States of Americaen
local.format.startpage885en
local.format.endpage905en
local.identifier.scopusid84930145276en
local.peerreviewedYesen
local.identifier.volume32en
local.identifier.issue3en
local.contributor.lastnameBolanden
local.contributor.lastnameKalinowskien
local.contributor.lastnameKauren
dc.identifier.staffune-id:tkalinowen
local.profile.orcid0000-0002-8444-6848en
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/26795en
local.date.onlineversion2015-05-29-
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleScheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time perioden
local.output.categorydescriptionC1 Refereed Article in a Scholarly Journalen
local.relation.grantdescriptionARC/LP0990739en
local.search.authorBoland, Natashiaen
local.search.authorKalinowski, Thomasen
local.search.authorKaur, Simranjiten
local.uneassociationUnknownen
local.year.available2015en
local.year.published2016en
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/7cfe884c-30e7-43f4-8cfd-4e4876a9bc08en
local.subject.for2020490304 Optimisationen
local.subject.for2020490108 Operations researchen
local.subject.seo2020280118 Expanding knowledge in the mathematical sciencesen
Appears in Collections:Journal Article
School of Science and Technology
Files in This Item:
1 files
File SizeFormat 
Show simple item record
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.