2015
DOI: 10.1016/j.cie.2015.04.010
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony optimization approach for solving an operating room surgery scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
65
0
3

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 83 publications
(68 citation statements)
references
References 24 publications
0
65
0
3
Order By: Relevance
“…Evolutionary heuristic methods make it possible to model dynamic integrated forward/reverse logistics network for 3rd party logistics (3PL) providers, where GA optimizes the network plan to help in the determination of resource plans for capacities of technical and human resources [9]. Ant colony based heuristics support open shop scheduling problems with a multi-skills resource constraint [10] and the solution of operating room surgery scheduling [11]. Scheduling of temporary and skilled-workers in dynamic cellular manufacturing systems can be solved by hybrid algorithms [12].…”
Section: State Of the Art In Human Resource Researchmentioning
confidence: 99%
“…Evolutionary heuristic methods make it possible to model dynamic integrated forward/reverse logistics network for 3rd party logistics (3PL) providers, where GA optimizes the network plan to help in the determination of resource plans for capacities of technical and human resources [9]. Ant colony based heuristics support open shop scheduling problems with a multi-skills resource constraint [10] and the solution of operating room surgery scheduling [11]. Scheduling of temporary and skilled-workers in dynamic cellular manufacturing systems can be solved by hybrid algorithms [12].…”
Section: State Of the Art In Human Resource Researchmentioning
confidence: 99%
“…NP-hard problems in large-scale are tackled by meta-heuristic and swarm intelligence algorithms (Dekhici andBelkadi, 2015, Arun andKumar, 2017). In many researches in the field of the SCS problem, some heuristic or meta-heuristic procedures such as genetic algorithm (Marques et al, 2014), simulated annealing Demeulemeester, 2007, Beliën et al, 2009), tabu search (Lamiri et al, 2009, Saremi et al, 2013, and ant colony optimization (Xiang et al, 2015 were developed to achieve near-optimal solutions, because this problem is NP-hard combinatorial optimization problem (Marques et al, 2014). The ACO is compatible with the MRSCS problem since this is classified into the constructive algorithms and these always generate a feasible solution in a short time,while improvement approaches may generate infeasible solutions for the MRSCS after applying their operators and hence more time may be needed to repair the infeasible solutions.…”
Section: Background and Related Workmentioning
confidence: 99%
“…In solving strongly NP-hard problems, researchers use either hybrid Artificial Intelligence methods based on combining the positive properties of individual evolutionary computing methods, or solving multi-objective optimization problems [23,46]. Particularly deeply explored is the field of Planning and Scheduling, from service activities [42] to production systems [37]. The authors implement Artificial Intelligence algorithms to benchmark examples [28], as well as to realworld examples [33].…”
Section: Literature Reviewmentioning
confidence: 99%