Improved arithmetic optimization algorithm for patient admission scheduling problem
The patient admission scheduling problem (PASP) has been studied for many years as one of the most important scheduling problems in the health sector. The primary goal of PASP is to assign patients to appropriate hospital beds while considering some hard and soft constraints. PASP is an NP-hard prob...
Saved in:
| Published in: | Soft computing (Berlin, Germany) Vol. 28; no. 7-8; pp. 5853 - 5879 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.04.2024
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1432-7643, 1433-7479 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!