{"title":"Multi-objective mathematical models to resolve parallel machine scheduling problems with multiple resources","authors":"Salma Kanoun, B. Jerbi, H. Kamoun, Lobna Kallel","doi":"10.2298/yjor221215008k","DOIUrl":null,"url":null,"abstract":"Mathematical programming, and above all, the multi-objective scheduling problems stand as remarkably versatile tools, highly useful for optimizing the health care services. In this context, the present work is designed to put forward two-fold multi-objective mixed integer linear programs, simultaneously integrating the objectives of minimizing the patients? total waiting and flow time, while minimizing the doctors' work-load variations. For this purpose, the three major health-care system intervening actors are simultaneously considered, namely, the patients, doctors and machines. To the best of our knowledge, such an issue does not seem to be actually addressed in the relevant literature. To this end, we opt for implementing an appropriate lexicographic method, whereby, effective solutions enabling to minimize the performance of two-objective functions could be used to solve randomly generated small cases. Mathematical models of our study have been resolved using the CPLEX software. Then, results have been comparatively assessed in terms of both objectives and CPU times. A real laser-treatment case study, involving a set of diabetic retinopathy patients in the ophthalmology department in Habib Bourguiba Hospital in Sfax, Tunisia, helps in illustrating the effective practicality of our advanced approach. To resolve the treated problem, we use three relevant heuristics which have been compared to the first-come first-served rule. We find that the program based on our second formulation with time-limit provided the best solution in terms of total flow time.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Yugoslav Journal of Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/yjor221215008k","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 0
Abstract
Mathematical programming, and above all, the multi-objective scheduling problems stand as remarkably versatile tools, highly useful for optimizing the health care services. In this context, the present work is designed to put forward two-fold multi-objective mixed integer linear programs, simultaneously integrating the objectives of minimizing the patients? total waiting and flow time, while minimizing the doctors' work-load variations. For this purpose, the three major health-care system intervening actors are simultaneously considered, namely, the patients, doctors and machines. To the best of our knowledge, such an issue does not seem to be actually addressed in the relevant literature. To this end, we opt for implementing an appropriate lexicographic method, whereby, effective solutions enabling to minimize the performance of two-objective functions could be used to solve randomly generated small cases. Mathematical models of our study have been resolved using the CPLEX software. Then, results have been comparatively assessed in terms of both objectives and CPU times. A real laser-treatment case study, involving a set of diabetic retinopathy patients in the ophthalmology department in Habib Bourguiba Hospital in Sfax, Tunisia, helps in illustrating the effective practicality of our advanced approach. To resolve the treated problem, we use three relevant heuristics which have been compared to the first-come first-served rule. We find that the program based on our second formulation with time-limit provided the best solution in terms of total flow time.