English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we address the multiple operating room (OR) surgical casesequencing problem (SCSP). The objective is to maximise total OR utilisationduring standard opening hours. This work uses a case study of a largeAustralian public hospital with long surgical waiting lists and high levels ofnon-elective demand. Due to the complexity of the SCSP and the size of theinstances considered herein, heuristic techniques are required to solve theproblem. We present constructive heuristics based on both a modified blockscheduling policy and an open scheduling policy. A number of real-time reactivestrategies are presented that can be used to maintain schedule feasibility inthe case of disruptions. Results of computational experiments show that thisapproach maintains schedule feasibility in real-time, whilst increasingoperating theatre (OT) utilisation and throughput, and reducing the waitingtime of non-elective patients. The framework presented here is applicable tothe real-life scheduling of OT departments, and we provide recommendationsregarding implementation of the approach.

A real-time reactive framework for the surgical case sequencing problem