2018
DOI: 10.1016/j.knosys.2018.01.017
|View full text |Cite
|
Sign up to set email alerts
|

Late acceptance hill climbing algorithm for solving patient admission scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(11 citation statements)
references
References 25 publications
0
10
0
1
Order By: Relevance
“…At the same time, a different probabilistic mechanism determines the time spent in each stage. The transition probabilities are assumed to depend on the current state, and the time spent in each step is considered to depend on the present and following conditions [ 45 , 46 ]. Many researchers use Markovian methods to investigate service scheduling research, such as for ambulance unloading delays, a Markovian queueing model was used [ 47 , 48 ].…”
Section: Results and Analysismentioning
confidence: 99%
“…At the same time, a different probabilistic mechanism determines the time spent in each stage. The transition probabilities are assumed to depend on the current state, and the time spent in each step is considered to depend on the present and following conditions [ 45 , 46 ]. Many researchers use Markovian methods to investigate service scheduling research, such as for ambulance unloading delays, a Markovian queueing model was used [ 47 , 48 ].…”
Section: Results and Analysismentioning
confidence: 99%
“…In this work the author gives a guideline on how to set up the penalty values for the soft constraints. Moreover, [ 30 ] presented a newly metaheurstic approach known as Late Acceptance Hill Climbing Algorithm (LAHC) to address PASP problem. LAHC type of meta-heurstic and considered as a one-point solution technique.…”
Section: Patient Admission Scheduling Problem (Pasp)mentioning
confidence: 99%
“…Therefore, late acceptance hill climbing (LAHC) is proposed as a metaheuristic approach. Previous research has proven this method to be effective in solving other challenging combinatorial optimization problems which involve assignment and sequencing decisions (Fonseca et al, 2016;Van Den Dooren et al, 2017;Bolaji et al, 2018).…”
Section: Late Acceptance Hill Climbingmentioning
confidence: 99%