A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems
In this paper, the problem of finding an assignment of “<i>n</i>” surgeries to be presented in one of “<i>m</i>” identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathemat...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Applied System Innovation |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2571-5577/6/1/15 |
| _version_ | 1827758704595828736 |
|---|---|
| author | Amin Rahimi Seyed Mojtaba Hejazi Mostafa Zandieh Mirpouya Mirmozaffari |
| author_facet | Amin Rahimi Seyed Mojtaba Hejazi Mostafa Zandieh Mirpouya Mirmozaffari |
| author_sort | Amin Rahimi |
| collection | DOAJ |
| description | In this paper, the problem of finding an assignment of “<i>n</i>” surgeries to be presented in one of “<i>m</i>” identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods to address OR optimization problems are used. The job or surgical operation ordering in any OR is a permanent part of all sequencing and scheduling problems. The transportation times between ORs are defined based on the type of surgical operations and do not depend on distance, so there is no surgical operation waiting time for transferring. These problems are called no-wait open-shop scheduling problems (NWOSP) with transportation times. The transportation system for the problems is considered a multi-transportation system with no limitation on the number of transportation devices. Accordingly, this study modeled a novel combined no-wait open-shop surgical case scheduling problem (NWOSP-SCSP) with multi-transportation times for the first time to minimize the maximum percentile of makespan for OR as a single objective model. A mixed-integer linear program (MILP) with small-sized instances is solved. In addition to the small-sized model, a novel metaheuristic based on a hybrid simulated annealing (SA) algorithm to solve large-sized problems in an acceptable computational time is suggested, considering the comparison of the SA algorithm and a new recommended heuristic algorithm. Then, the proposed hybrid SA and SA algorithms are compared based on their performance measurement. After reaching the results with a numerical analysis in Nova Scotia health authority hospitals and health centers, the hybrid SA algorithm has generated significantly higher performance than the SA algorithm. |
| first_indexed | 2024-03-11T09:11:12Z |
| format | Article |
| id | doaj.art-9f8b08d1e4234494ae4ea0817e854241 |
| institution | Directory Open Access Journal |
| issn | 2571-5577 |
| language | English |
| last_indexed | 2024-03-11T09:11:12Z |
| publishDate | 2023-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied System Innovation |
| spelling | doaj.art-9f8b08d1e4234494ae4ea0817e8542412023-11-16T19:01:06ZengMDPI AGApplied System Innovation2571-55772023-01-01611510.3390/asi6010015A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling ProblemsAmin Rahimi0Seyed Mojtaba Hejazi1Mostafa Zandieh2Mirpouya Mirmozaffari3Faculty of Industrial and Mechanical Engineering, Qazvin Azad University, Qazvin 34185-1416, IranFaculty of Industrial and Mechanical Engineering, Qazvin Azad University, Qazvin 34185-1416, IranDepartment of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, General Campus, Tehran 19839-69411, IranDepartment of Industrial Engineering, Dalhousie University, 5269 Morris Street, Halifax, NS B3H 4R2, CanadaIn this paper, the problem of finding an assignment of “<i>n</i>” surgeries to be presented in one of “<i>m</i>” identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, mathematical and metaheuristic methods to address OR optimization problems are used. The job or surgical operation ordering in any OR is a permanent part of all sequencing and scheduling problems. The transportation times between ORs are defined based on the type of surgical operations and do not depend on distance, so there is no surgical operation waiting time for transferring. These problems are called no-wait open-shop scheduling problems (NWOSP) with transportation times. The transportation system for the problems is considered a multi-transportation system with no limitation on the number of transportation devices. Accordingly, this study modeled a novel combined no-wait open-shop surgical case scheduling problem (NWOSP-SCSP) with multi-transportation times for the first time to minimize the maximum percentile of makespan for OR as a single objective model. A mixed-integer linear program (MILP) with small-sized instances is solved. In addition to the small-sized model, a novel metaheuristic based on a hybrid simulated annealing (SA) algorithm to solve large-sized problems in an acceptable computational time is suggested, considering the comparison of the SA algorithm and a new recommended heuristic algorithm. Then, the proposed hybrid SA and SA algorithms are compared based on their performance measurement. After reaching the results with a numerical analysis in Nova Scotia health authority hospitals and health centers, the hybrid SA algorithm has generated significantly higher performance than the SA algorithm.https://www.mdpi.com/2571-5577/6/1/15hybrid meta-heuristic simulated annealing algorithmsoperating roomsno-wait open-shop surgical case scheduling problemmakespantransportation timemixed integer linear programming |
| spellingShingle | Amin Rahimi Seyed Mojtaba Hejazi Mostafa Zandieh Mirpouya Mirmozaffari A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems Applied System Innovation hybrid meta-heuristic simulated annealing algorithms operating rooms no-wait open-shop surgical case scheduling problem makespan transportation time mixed integer linear programming |
| title | A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems |
| title_full | A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems |
| title_fullStr | A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems |
| title_full_unstemmed | A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems |
| title_short | A Novel Hybrid Simulated Annealing for No-Wait Open-Shop Surgical Case Scheduling Problems |
| title_sort | novel hybrid simulated annealing for no wait open shop surgical case scheduling problems |
| topic | hybrid meta-heuristic simulated annealing algorithms operating rooms no-wait open-shop surgical case scheduling problem makespan transportation time mixed integer linear programming |
| url | https://www.mdpi.com/2571-5577/6/1/15 |
| work_keys_str_mv | AT aminrahimi anovelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT seyedmojtabahejazi anovelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT mostafazandieh anovelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT mirpouyamirmozaffari anovelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT aminrahimi novelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT seyedmojtabahejazi novelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT mostafazandieh novelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems AT mirpouyamirmozaffari novelhybridsimulatedannealingfornowaitopenshopsurgicalcaseschedulingproblems |