Badreddine Jerbi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Badreddine Jerbi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Hichem Kamoun
University of Sfax
4 shared publicationsAbdelaziz Dammak
2 shared publicationsHadhemi Saadouli
2 shared publications- Hichem Kamoun
Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems, Faculty of Economic Sciences and Management, University of Sfax, Sfax, Tunisia
2 shared publications - Salma Kanoun
Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems, Faculty of Economic Sciences and Management, University of Sfax, Sfax, Tunisia
2 shared publications Abir Bouaziz
1 shared publication
Latest Publications
- Open Access
- 31 August 2026
- Published by Scientific Scholar in JOURNAL of QASSIM UNIVERSITY FOR SCIENCE
- Vol. 5 (5) , 528-539
Applications of Operations Research (OR) Tools in Healthcare Systems: A Comprehensive Review
This paper provides a comprehensive and systematic analysis of the role of operations research (OR) approaches in modern healthcare systems. The study examines a broad range of OR techniques, including linear programming, simulation, queuing theory, stochastic optimization, decision analysis, and meta-heuristics. It focuses on critical operational domains such as patient scheduling, bed management, healthcare logistics, and emergency medical services. By synthesizing findings from 28 relevant studies, the review highlights the impact of OR on healthcare efficiency and patient outcomes while identifying implementation challenges and future technological directions.
- 31 August 2026
- Published by Scientific Scholar in JOURNAL of QASSIM UNIVERSITY FOR SCIENCE
- Vol. 5 (5) , 528-539
Open AccessApplications of Operations Research (OR) Tools in Healthcare Systems: A Comprehensive Review
This paper provides a comprehensive and systematic analysis of the role of operations research (OR) approaches in modern healthcare systems. The study examines a broad range of OR techniques, including linear programming, simulation, queuing theory, stochastic optimization, decision analysis, and meta-heuristics. It focuses on critical operational domains such as patient scheduling, bed management, healthcare logistics, and emergency medical services. By synthesizing findings from 28 relevant studies, the review highlights the impact of OR on healthcare efficiency and patient outcomes while identifying implementation challenges and future technological directions.
- Open Access
- 1 January 2025
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 35 (2) , 365-382
Multi-objective mathematical programs to minimize the makespan, the patients' flow time, and doctors' workloads variation using dispatching rules and genetic algorithm
The World Health Report estimated that 20-40% of health sector resources are wasted globally. Balancing many conflicting objectives such as clinical excellence, cost containment, and patient satisfaction can be challenging. In fact, multiple objective programming is one of the best tools that can be used for logistics optimization in many organizations. The aim of our paper is to propose a multi-objective mixed integer linear program that satisfies the goals of two important actors in the healthcare system: patients and doctors. The problem considers a parallel machine scheduling model that integrates simultaneously the following most known objectives in healthcare systems: minimization of the makespan, the patients' total flow times, and the doctors' workloads variations. The current paper deals with a real case study where the number of doctors exceeds the number of machines. A mathematical model combined with some dispatching rules was developed and solved using the CPLEX software, which shows the practical importance of our approach. For small instances, we use a mathematical programming model and a heuristic method based on the ?first come, first served? rule to assign patients to machines and doctors. For larger instances, we use a genetic algorithm to approximately solve our multi-objective model.
- 1 January 2025
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 35 (2) , 365-382
Open AccessMulti-objective mathematical programs to minimize the makespan, the patients' flow time, and doctors' workloads variation using dispatching rules and genetic algorithm
The World Health Report estimated that 20-40% of health sector resources are wasted globally. Balancing many conflicting objectives such as clinical excellence, cost containment, and patient satisfaction can be challenging. In fact, multiple objective programming is one of the best tools that can be used for logistics optimization in many organizations. The aim of our paper is to propose a multi-objective mixed integer linear program that satisfies the goals of two important actors in the healthcare system: patients and doctors. The problem considers a parallel machine scheduling model that integrates simultaneously the following most known objectives in healthcare systems: minimization of the makespan, the patients' total flow times, and the doctors' workloads variations. The current paper deals with a real case study where the number of doctors exceeds the number of machines. A mathematical model combined with some dispatching rules was developed and solved using the CPLEX software, which shows the practical importance of our approach. For small instances, we use a mathematical programming model and a heuristic method based on the ?first come, first served? rule to assign patients to machines and doctors. For larger instances, we use a genetic algorithm to approximately solve our multi-objective model.
- Open Access
- 1 January 2023
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 33 (4) , 577-600
Multi-objective mathematical models to resolve parallel machine scheduling problems with multiple resources
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.
- 1 January 2023
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 33 (4) , 577-600
Open AccessMulti-objective mathematical models to resolve parallel machine scheduling problems with multiple resources
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.
- 12 September 2020
- Published by Wiley in Journal of Multi-Criteria Decision Analysis
- Vol. 28 (1-2) , 34-44
A fuzzy multi‐objective polynomial time algorithm to solve the stochastic transportation formulation of a hospital bed rearrangement problem
This article considers the problem of bed rearrangement in a hospital. The problem is formulated as multi‐objective mathematical program. The objectives driving the reallocation of beds could be conflicting in nature. The number of needed beds in each department is found to be highly related to length of stay (LOS) of a patient. Some described it as a random variable following a power law distribution. Hence, determining the number of the reallocated beds in each department could be treated stochastically because it depends on the fluctuation of the LOS. The complexity of the problem is taking care of by formulating the problem as multi‐objective stochastic transportation problem and finding a compromise solution using a linear fuzzy function on the deterministic equivalent. The program is polynomial time solvable. The approach is illustrated through a bi‐objective bed rearrangement problem, treating the possibility of increasing the admissions and the bed occupation, with real data from a hospital.
- 12 September 2020
- Published by Wiley in Journal of Multi-Criteria Decision Analysis
- Vol. 28 (1-2) , 34-44
A fuzzy multi‐objective polynomial time algorithm to solve the stochastic transportation formulation of a hospital bed rearrangement problem
This article considers the problem of bed rearrangement in a hospital. The problem is formulated as multi‐objective mathematical program. The objectives driving the reallocation of beds could be conflicting in nature. The number of needed beds in each department is found to be highly related to length of stay (LOS) of a patient. Some described it as a random variable following a power law distribution. Hence, determining the number of the reallocated beds in each department could be treated stochastically because it depends on the fluctuation of the LOS. The complexity of the problem is taking care of by formulating the problem as multi‐objective stochastic transportation problem and finding a compromise solution using a linear fuzzy function on the deterministic equivalent. The program is polynomial time solvable. The approach is illustrated through a bi‐objective bed rearrangement problem, treating the possibility of increasing the admissions and the bed occupation, with real data from a hospital.
- 25 July 2020
- Published by Springer Nature
- p. 103-121
Modeling and Simulation in Dialysis Center of Hedi Chaker Hospital
- 25 July 2020
- Published by Springer Nature
- p. 103-121
Modeling and Simulation in Dialysis Center of Hedi Chaker Hospital
- 1 January 2018
- Published by University of Economics in Katowice in Multiple Criteria Decision Making
- Vol. 13, 74-87
Menu planning with a dynamic goal programming approach
Biblioteka cyfrowa regionu śląskiego - kulturowe dziedzictwo Śląska w jego historycznej i współczesnej różnorodności.
- 1 January 2018
- Published by University of Economics in Katowice in Multiple Criteria Decision Making
- Vol. 13, 74-87
Menu planning with a dynamic goal programming approach
Biblioteka cyfrowa regionu śląskiego - kulturowe dziedzictwo Śląska w jego historycznej i współczesnej różnorodności.
- 1 February 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 80, 72-79
A stochastic optimization and simulation approach for scheduling operating rooms and recovery beds in an orthopedic surgery department
- 1 February 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 80, 72-79
A stochastic optimization and simulation approach for scheduling operating rooms and recovery beds in an orthopedic surgery department
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-262
An optimization and simulation approach for Operating room scheduling under stochastic durations
Several variants of the Operating room scheduling problem are provided in literature for different contexts. In Tunisia, especially in Habib Bourguiba Hospital in Sfax, Open scheduling policy is considered to schedule elective surgeries. In the orthopedic service, operating room scheduling is carried out weekly. Three operating rooms are available and one of them is assigned to a special kind of surgeries called septic. At the tactical level, elective operations are assigned to weeks so that the workload (average) by week is approximately equal to the weekly capacity. In the selection of surgeries the variation of surgery duration is not taken into account. The average of the operations durations are considered for planning and scheduling. This situation can lead to either an overtime which is unwelcome by surgeons and surgical team. Or an underutilization of OR resources which generate an additional cost for hospital. To deal with this problem, we propose two stochastic MILP models that take into account the stochastic aspect of the surgery duration. Once the set of operations to be carried out in a week are selected, we choose at the operational level to which day and which room the operations are assigned and in which order. As patients are asked to come to the hospital in the morning, the best scheduling is the one that minimizes the patients waiting time. In this paper, we provide two MILP to model this problem. In the first one an additive slack is given to the total duration of surgery to deal with any possible overtime. The other one try to equilibrate the total charge between room/day and the total surgery variations during the week. The two models are solved using Cplex and then a simulation model is used to evaluate the robustness of the provided solutions.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 257-262
An optimization and simulation approach for Operating room scheduling under stochastic durations
Several variants of the Operating room scheduling problem are provided in literature for different contexts. In Tunisia, especially in Habib Bourguiba Hospital in Sfax, Open scheduling policy is considered to schedule elective surgeries. In the orthopedic service, operating room scheduling is carried out weekly. Three operating rooms are available and one of them is assigned to a special kind of surgeries called septic. At the tactical level, elective operations are assigned to weeks so that the workload (average) by week is approximately equal to the weekly capacity. In the selection of surgeries the variation of surgery duration is not taken into account. The average of the operations durations are considered for planning and scheduling. This situation can lead to either an overtime which is unwelcome by surgeons and surgical team. Or an underutilization of OR resources which generate an additional cost for hospital. To deal with this problem, we propose two stochastic MILP models that take into account the stochastic aspect of the surgery duration. Once the set of operations to be carried out in a week are selected, we choose at the operational level to which day and which room the operations are assigned and in which order. As patients are asked to come to the hospital in the morning, the best scheduling is the one that minimizes the patients waiting time. In this paper, we provide two MILP to model this problem. In the first one an additive slack is given to the total duration of surgery to deal with any possible overtime. The other one try to equilibrate the total charge between room/day and the total surgery variations during the week. The two models are solved using Cplex and then a simulation model is used to evaluate the robustness of the provided solutions.
- 1 May 2011
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 19 (5) , 1363-1370
Multiobjective study to implement outpatient appointment system at Hedi Chaker Hospital
- 1 May 2011
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 19 (5) , 1363-1370
Multiobjective study to implement outpatient appointment system at Hedi Chaker Hospital
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Applied Management Science
- Vol. 2 (2) , 122
Using stochastic goal programming to rearrange beds inside Habib Bourguiba Hospital
This paper considers the problem of bed rearrangement in hospitals and proposes some research tools to provide an effective and balanced rearrangement of beds. By studying the activity report of Habib Bourguiba Hospital, it was found that some departments have a shortage while others have a surplus in beds. Working with a shortage in beds is highly unpleasant for both patients and staff. It affects all types of qualities. Bed managers are usually faced with a situation where they have to find beds in another department or refuse patients. This leads to higher risks and complications. We use a stochastic goal program and satisfaction function concepts to rearrange the beds. The optimal plan of the number of beds to be transferred from one department to the other is given as well as a comparison indicating that the proposed solution is superior to the one existing.
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Applied Management Science
- Vol. 2 (2) , 122
Using stochastic goal programming to rearrange beds inside Habib Bourguiba Hospital
This paper considers the problem of bed rearrangement in hospitals and proposes some research tools to provide an effective and balanced rearrangement of beds. By studying the activity report of Habib Bourguiba Hospital, it was found that some departments have a shortage while others have a surplus in beds. Working with a shortage in beds is highly unpleasant for both patients and staff. It affects all types of qualities. Bed managers are usually faced with a situation where they have to find beds in another department or refuse patients. This leads to higher risks and complications. We use a stochastic goal program and satisfaction function concepts to rearrange the beds. The optimal plan of the number of beds to be transferred from one department to the other is given as well as a comparison indicating that the proposed solution is superior to the one existing.