About: There are found a vast number of papers studying the problem of operating theater planning and scheduling. Different variants of this problem are generally recognized to be NP-complete; thus, several solution approaches have been utilized in the literature to confront with these complicated problems. The lack of a thorough review of the main characteristics of solution approaches is tangible in the literature (reviewing them separately and with regards to the characteristics of studied problems), which can provide pragmatic guidelines for practitioners and future research projects. This paper aims to address this issue. Since different types of solution approaches usually have different characteristics, this paper focuses only on metaheuristic algorithms. Through both automatic and manual search methods, we have selected and reviewed 28 papers with respect to their main problem and solution approach features. Finally, some directions are introduced for future research.   Goto Sponge  NotDistinct  Permalink

An Entity of Type : fabio:Abstract, within Data Space : covidontheweb.inria.fr associated with source document(s)

AttributesValues
type
value
  • There are found a vast number of papers studying the problem of operating theater planning and scheduling. Different variants of this problem are generally recognized to be NP-complete; thus, several solution approaches have been utilized in the literature to confront with these complicated problems. The lack of a thorough review of the main characteristics of solution approaches is tangible in the literature (reviewing them separately and with regards to the characteristics of studied problems), which can provide pragmatic guidelines for practitioners and future research projects. This paper aims to address this issue. Since different types of solution approaches usually have different characteristics, this paper focuses only on metaheuristic algorithms. Through both automatic and manual search methods, we have selected and reviewed 28 papers with respect to their main problem and solution approach features. Finally, some directions are introduced for future research.
Subject
  • Economic development
  • Economic geography
  • Lists of countries
  • Mathematical optimization
  • NP-complete problems
  • Complexity classes
  • 1971 in computer science
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software