2022
DOI: 10.1109/access.2022.3229709
|View full text |Cite
|
Sign up to set email alerts
|

A Two-Stage Genetic Artificial Bee Colony Algorithm for Solving Integrated Operating Room Planning and Scheduling Problem With Capacity Constraints of Downstream Wards

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 65 publications
0
0
0
Order By: Relevance
“…To solve the model, the study was based on genetic algorithm and ABC of genetic ABC. Experimental results showed that the algorithm can solve the best result in a shorter time and the quality of its solution is better than other comparative algorithms [ 8 ]. J. Q. Li et al proposed a hybrid ABC to solve the parallel batch distributed flow shop problem.…”
Section: Related Workmentioning
confidence: 99%
“…To solve the model, the study was based on genetic algorithm and ABC of genetic ABC. Experimental results showed that the algorithm can solve the best result in a shorter time and the quality of its solution is better than other comparative algorithms [ 8 ]. J. Q. Li et al proposed a hybrid ABC to solve the parallel batch distributed flow shop problem.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, it is not practical to assume turnover or sterilization time based on the length of the surgery. Thus, it needs to be considered separately, and the current study explicitly considers the sequence dependent setup times for advanced and allocation scheduling of surgeries in heterogeneous operating rooms, which is limited in literature [1,30,31].…”
Section: Introductionmentioning
confidence: 99%
“…The operating room planning and scheduling is NP-hard [74], and therefore, different metaheuristics have also been applied to solve this problem in reasonable computation to get near-optimal results [75,76]. Most researchers have studied operating room planning and scheduling problems using simulated annealing [77], genetic algorithm [44], constructive heuristics [4], hybrid simulated annealing [72], Tabu search [23,78], hill climbing algorithms [79], artificial bee colony algorithm [31], and ant colony algorithm [80,81], etc. The metaheuristics are the most common in operating room planning and scheduling literature [44,62,72,82].…”
Section: Introductionmentioning
confidence: 99%