Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15823
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRiise, Atle-
dc.contributor.authorBurke, Edmund-
dc.date.accessioned2018-02-15T03:11:29Z-
dc.date.available2018-02-15T03:11:29Z-
dc.date.issued2011-08-
dc.identifier.urihttp://hdl.handle.net/1893/15823-
dc.description.abstractWe present a model for the surgery admission planning problem, and a meta-heuristic algorithm for solving it. The problem involves assigning operating rooms and dates to a set of elective surgeries, as well as scheduling the surgeries of each day and room. Simultaneously, a schedule is created for each surgeon to avoid double bookings. The presented algorithm uses simple Relocate and Two-Exchange neighbourhoods, governed by an iterated local search framework. The problem's search space associated with these move operators is analysed for three typical fitness surfaces, representing different compromises between patient waiting time, surgeon overtime, and waiting time for children in the morning on the day of surgery. The analysis shows that for the same problem instances, the different objectives give fitness surfaces with quite different characteristics. We present computational results for a set of benchmarks that are based on the admission planning problem in a chosen Norwegian hospital.en_UK
dc.language.isoen-
dc.publisherSpringer-
dc.relationRiise A & Burke E (2011) Local search for the surgery admission planning problem, Journal of Heuristics, 17 (4), pp. 389-414.-
dc.rights© The Author(s) 2010. This article is published with open access at Springerlink.com-
dc.subjectSurgery allocationen_UK
dc.subjectSurgery schedulingen_UK
dc.subjectSurgery admission planningen_UK
dc.subjectOperating theatre planningen_UK
dc.subjectMeta-heuristicsen_UK
dc.subjectIterated local searchen_UK
dc.subjectSearch space analysisen_UK
dc.subject.lcshHealth service administration Norway-
dc.subject.lcshOperations, Surgical Scheduling-
dc.subject.lcshTime management-
dc.subject.lcshHospitals Admission and discharge-
dc.subject.lcshSurgeons Norway-
dc.titleLocal search for the surgery admission planning problemen_UK
dc.typeJournal Articleen_UK
dc.identifier.doihttp://dx.doi.org/10.1007/s10732-010-9139-x-
dc.citation.jtitleJournal of Heuristics-
dc.citation.issn1381-1231-
dc.citation.volume17-
dc.citation.issue4-
dc.citation.spage389-
dc.citation.epage414-
dc.citation.publicationstatusPublished-
dc.citation.peerreviewedRefereed-
dc.type.statusPublisher version (final published refereed version)-
dc.author.emaile.k.burke@stir.ac.uk-
dc.contributor.affiliationUniversity of Oslo-
dc.contributor.affiliationComputing Science and Mathematics-
dc.identifier.isi000295095700003-
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Local search for the surgery admission planning problem.pdf1.91 MBAdobe PDFView/Open


This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.