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

There are found a vast number of papers studying the problem of operatingtheater planning and scheduling. Different variants of this problem aregenerally recognized to be NP-complete; thus, several solution approaches havebeen utilized in the literature to confront with these complicated problems.The lack of a thorough review of the main characteristics of solutionapproaches is tangible in the literature (reviewing them separately and withregards to the characteristics of studied problems), which can providepragmatic guidelines for practitioners and future research projects. This paperaims to address this issue. Since different types of solution approachesusually have different characteristics, this paper focuses only onmetaheuristic algorithms. Through both automatic and manual search methods, wehave selected and reviewed 28 papers with respect to their main problem andsolution approach features. Finally, some directions are introduced for futureresearch.

Metaheuristics for the operating theater planning and scheduling: A systematic review