In the face of an increasingly highdemand environment for outpatients, achieving a balance between allocation of limited medical resources and patient satisfaction has considerable social and economic benefits. Therefore, appointment scheduling (AS) system operation is used in clinics and hospitals, and its operation optimization research is of great significance.
1. Introduction
Healthcare extends beyond medical care and encompasses the delivery of services aimed at promoting, preserving, monitoring, or restoring health for individuals or communities through the expertise of healthcare professionals or services ^{[1]}. The development of the healthcare system is more important over the past few decades, and it is facing increased costs, increasing number of users, a more conscious population about healthcare issues, and increased demand for quality healthcare services ^{[2]}. Most countries are experiencing ageing and population growth, which led to an oversupply of doctors, unequal distribution of resources and inefficiency. This shows that the experience of the healthcare system affects the economy and prosperity of cities around the world ^{[3]}^{[4]}^{[5]}.
The scheduling of outpatient departments has become more important in healthcare systems aiming at the efficient utilization of available hospital resources to provide satisfactory services to patients. Patient access to healthcare services and extended wait durations have been identified as major problems in ambulatory care systems ^{[6]}^{[7]}. It affects the productivity, pressure, and effectiveness of medical staff, as well as the cost and availability, quality, and efficiency of care. Various factors can impact the performance of outpatient delivery systems, including the clinic’s environment and conditions, the adopted appointment policies, the timeliness of patients, and the unpredictability of demand ^{[8]}. Appointment scheduling (AS) is an indispensable part of the efficient operation of an outpatient clinic, which improves the utilization of healthcare resources such as personnel and equipment. The core problem of AS is to reduce patient waiting and doctor downtime by creating an appointment system that assigns an available time slot to the patient ^{[9]}. Appointment scheduling constitutes a challenge in allocating resources amid uncertainty within the field of IE/OR. A decisionmaking process is needed to reduce operational costs and improve health management services ^{[10]}^{[11]}^{[12]}^{[13]}.
With the advancement of modernization of medical technology and the continuous growth of patient consultation in recent years, AS will have a wider application in the future. Therefore, theoretical value and significance are associated with the research on optimizing AS operations. By conducting optimization calculations, an AS system is formulated to improve the efficiency of medical operation
^{[14]}^{[15]}^{[16]}. There are many related studies on AS system optimization.
2. System Structure of AS
2.1. AS Characteristics
The scheduling of appointments within outpatient departments stands as an extensively investigated subject, playing a pivotal role in facilitating the efficient utilization of clinical services. It is a topic that demands indepth research, given its significance in ensuring timely access to highquality care for patients. In outpatient services, a central issue for scheduling staff is how to allocate available time slots for patients, thereby reducing patient delays and physician availability or additional time ^{[17]}^{[18]}. The role of appointment scheduling systems in optimizing quality healthcare has been recognized as a challenging problem ^{[19]}. Appointment scheduling systems are a wellpositioned and practical research area. Unlike the traditional way of registering for appointments, it avoids crowd gathering as well as the unknown nature of patient scheduling, and greatly improves the services’ efficiency, which is an emerging field of research within healthcare ^{[20]}^{[21]}^{[22]}. The attributes of ASs are primarily evident in two aspects:
1. Uncertainty AS performance;
Patient unpunctuality is common in many healthcare organizations, and even failure to show up for appointments exists. Patients arriving earlier or later can complicate the AS system design. Late or noshow patients can lead to doctor availability affecting the waiting time of subsequent patients thus reducing efficiency ^{[23]}^{[24]}. At the same time, the AS system considers that doctors are not always on time, and the nature of their work leads to the possibility that they may not always arrive on time when they are on the operating table or in emergency resuscitation ward consultations ^{[25]}^{[26]}. The AS system considers the changing circumstances of both parties and thus conducts outpatient scheduling.
 2.

ASs can be extended to represent other industries.
AS system design and analysis are very complex. AS systems need to consider nurses and other medical tests or other staff operating diagnostic machines and assisting patients, so the appointment scheduling plan is mainly considered as a resource focused on physician professors ^{[27]}^{[28]}. It is also comprehensive to consider that nurses and other staff members are assigned to diagnostic resources before patients can be scheduled for further consultation. The AS problem is a resource allocation problem, and the establishment of AS systems can be extended to multiple other resourcelimited industries. Outside of healthcare, transportation, hospitality, restaurant reservations, etc., have been referenced and improved in terms of operations, profit models, and customer wait times ^{[29]}^{[30]}^{[31]}.
2.2. System Structure of AS
The prerequisite for building an AS system is to be familiar with the patient consultation process, as we all know, anyone who wants to consult needs to arrive at the hospital outpatient clinic as early as possible, and then go to the registration desk to obtain a number (even if you use the online advance booking needs to be in accordance with the booking time to report to the queue and wait). After receiving your number, you will wait in the designated viewing area and meet with the doctor when you are called. After the consultation, the patient may need to undergo further tests and return to the queue to consult with the doctor again after receiving the results ^{[32]}. Figure 1 illustrates the structure of the process for the patient’s outpatient consultation in a clinical setting. The AS system design is viewed as a range of decisionmaking hierarchies, including appointment rules, classification of patients, and adjustments for reducing the disruptive effect of noshows, walkins, and emergency patients ^{[33]}.
Figure 1. The flow structure of the patient in the hospitals.
2.2.1. Appointment Rules
AS system operation optimization typically improves healthcare system performance by designing AS rules. These regulations describe the duration of each appointment interval and the number of patients (block size) to be accommodated during that interval. By utilizing various permutations of fixed and variable appointment interval lengths, several innovative rules have been developed to make the operation of the system more responsive to actual consultation needs ^{[34]}. The appointment rules of the AS system are expressed in terms of blocksize (𝑛𝑖: the number of patients assigned per block 𝑖), beginblock (𝑛1:patients assigned the same appointments at the session’s outset), and appointment interval (𝑎𝑖: the interval between two consecutive appointments). The block size and the scheduling interval can be fixed or variable, so the reservation rules composed by the combination of any of its three variables ( ${n}_{i},{n}_{1},{a}_{i}$ ) ^{[35]}.
1. Fixedinterval rules.
The fixedinterval rule refers to equal intervals throughout the consultation. The intervals between the first patient and the subsequent patient and between every two subsequent patients are fixed, i.e., ai is constant. There are some differences in the other two variables under the fixedinterval rule. Simply, the IBFI (individualblock/fixedinterval rule) assigns individual appointments to every patient with equal intervals throughout the consultation, meaning that ${n}_{\mathrm{i}}=1,{n}_{1}=1$ ^{[36]}. Considering the patient’s late arrival or noshow, it is possible to increase the number of appointments at the beginning of the meeting for the same time patient refers to n_{1} > 1. Avoiding the phenomenon of doctor’s idleness improves the efficiency of healthcare workers. Bailey et al. ^{[37]}^{[38]} proposed an individualblock system assigning two patients at the session’s start and scheduling the rest at intervals matching the mean consultation time. This highlights the need for thorough research into outpatient appointment scheduling ( ${n}_{1}=2,{n}_{i}=1$ ).
The multipleblock/fixedinterval rule can be interpreted as assigning m patients to the appointment slot with a constant appointment interval. The multipleblock rule performs better when the consultation time is shorter, and the rise in patient numbers in the same appointment time slot allows for more flexibility in the physician’s and patient’s time. Soriano et al.
^{[39]} studied a system in which patients are scheduled in pairs, with intervals set at twice the mean consultation time. In fact, blocksize can also be variable; the rules allow variations in block sizes throughout the clinic session.
 2.

Variableinterval rules.
Rules with constant intervals are in fact unlikely to perform well in all environments, so more research has focused on optimizing AS systems using variable interval rules. This rule is to schedule patients individually when the interval is variable. Considerations are made for walkins, noshows, and urgent cases whenever they occur during the planning of an AS ^{[40]}. Therefore, there is a need to adjust AS by making advanced predictions to reduce their damaging effects. The literature suggests two solutions. The first is to book other patients into a single slot in the presence of noshows and maintain some vacant slots for walkins ^{[41]}. The other method is to adjust the appointment interval so that it is proportional to the probability ^{[42]}. Universal rules are proposed, for example, the” offset” rules, the” dome” rules and the “plateaudome” rules.
The “offset” rule refers to a set of rules which modifies the appointment times based on the allocated appointment slots. A framework of different reservation rules for different operational environments is established, which emphasizes that there is no “universally good” rule, and that the appropriate rule needs to be selected by determining the value of some environmental factors. Rohleder et al. ^{[43]} applied the offset as shown in Equation (1), where the early time slots are below the average service duration and the late time slots are even longer, which in various situations leads to a very late end of the session.
$$\begin{array}{c}{T}_{i}=\{\begin{array}{c}{A}_{s}{k}_{1}\sigma \left(Ks\right)\text{}for\text{}i\text{}and\text{}s=1,2,\dots ,K\\ {A}_{s}+{k}_{2}\sigma \left(sK\right)\text{}for\text{}i\text{}and\text{}s=K+1,K+2,\dots 21\end{array}\end{array}$$
where
T_{i} is the planned time for client
i appointment, as is the standard time for
s, and
𝜎 is variability in service time. The parameters
$K$ ,
${k}_{1},{k}_{2}$ are the early breakpoints, delay breakpoints and the multipliers.
( $({k}_{1}/{k}_{2})$ ) controls the earliness rate imposed on the first
𝐾 patients and the rate of lateness imposed on the remaining patients.
The most prominent finding in the study of variable interval rules is the “dome” rule, including absences and appointments, and patient categorization. The universal appointment rule demonstrate effective performance, independent of the clinical environment ^{[44]}. Optimal scheduling exhibits a dome pattern, whereby appointment intervals begin to grow later in the session and then decrease. Dome mode reduces wait times compared to other scheduling rules ^{[45]}. Considering noshows and walkins, the patient count scheduled to achieve the target T patients served at a session is calculated as follows ^{[46]}.
$$\begin{array}{c}N=\frac{T}{\left(1{P}_{n}+{P}_{w}\right)}\end{array}$$
In this formula, 𝑃𝑛 is that a patient fails to attend and 𝑃𝑤 is the probability of coming without an appointment.
The appointment times are determined through a twostep process employing the subsequent formula:
$$\begin{array}{c}{A}_{i}=max\left\{0,k\left(i1\right)\mu \sigma \sqrt{i}\cdot \pi \right\}for\text{}i=1,\dots ,N\text{}where\text{}\pi =\left(N+i\right)/\left(N1\right)\end{array}$$
In this formula, 𝐴𝑖 is the patient 𝑖’s scheduled time, with the mean duration of service μ, and variability in service time 𝜎. The k controls the appointment intervals for different appointment rules by setting different values. π is a parameter utilized to establish a pattern resembling a “dome” in the appointment intervals.
$$\begin{array}{c}K=f\left(N,{C}_{v},{P}_{n},{P}_{w},CR\right)\end{array}$$
In Equation (4), 𝐶𝑣 is the coefficient of variation; and CR is the ratio of the cost of the doctor’s time to that of the patients’ time.
Considering the combined impact of noshows and walkins on the consultation durations, the updated formulas for the mean and variance are shown
$$\begin{array}{c}{\mu}^{\prime}=\left(1{P}_{n}+{P}_{w}\right)\mu \end{array}$$
$$\sigma {\prime}^{2}=\left(1{P}_{n}{P}_{w}\right)({\sigma}^{2}+{({P}_{n}{P}_{w})}^{2}{\mu}^{2}+{P}_{n}{(1{P}_{n}+{P}_{w})}^{2}{\mu}^{2}+{P}_{w}(2{\sigma}^{2}+{(1+{P}_{n}{P}_{w})}^{2}{\mu}^{2}$$
 The “plateaudome” appointment rule.
Doctors could find advantages in implementing a “plateaudome” rule with fixed individual blocks evenly distributed in the middle of the appointment session ^{[47]}, explicitly modelling the impact that the doctor’s interruptions may have on optimal appointment times, and thereby affecting waiting times for patients. A traditional pattern for the high number of interrupts and flat dome mode for a low number of interrupts performs better ^{[48]}. This was achieved by conducting an additional run with the supplementary constraint:
$$\begin{array}{c}{x}_{i}2{x}_{i+1}+{x}_{i+2}=0\end{array}\text{}for\text{}i\u03f5\left[\alpha ,\beta \right]$$
In this formula,
𝑥𝑖 is the appointment time, and
𝛼 and
𝛽 are the appointment slots corresponding to the beginning and end of the plateau portion, respectively.
2.2.2. Patient Classification
Several investigations have explored the implementation of patient classification (PC) based on the assumption that populations can be categorized into distinct groups. For example, in practice, a prevalent method of classifying patients is according to whether they are new or old who have been examined for a different length of time. This allows patients to be sorted at the time of the appointment, and diversity in consultation duration is combined by patient categorization to adjust the length of the appointment interval according to the characteristics of each group. Most studies are only concerned with the scheduling of patients attending elective appointments ^{[49]}. Meersman et al. proposed the scheduling horizon involves the time slots for elective and urgent patient categories ^{[50]}, considering the slot allocation of nonelective patients.
2.3. AS System Decision Framework
In AS system design and planning, a range of decisions and planning determine the main structure of the optimization research system. They can be categorized into three types which are strategic, tactical and operational
^{[51]}. Strategic decisions are the keys in shaping the modeling process and determining the practical applicability of the proposed solutions. Such decisions are usually considered as inputs to the AS system. Tactical decisions aim at determining the system structure. While operational decisions rely on the first two to develop optimization models and rules.
2.3.1. Strategic Decisions
Strategic decisions are considered as inputs and are longterm decisions that determine the main structure of the AS system. Robinson et al. ^{[52]} proposed three main types of access strategies for scheduled patients: traditional, open access, and hybrid. Traditional policies mean all capacity is allocated to prescheduled patients, which results in higher noshow rates and longer wait times.
Walkin patients refer to patients who go to the clinic without an appointment during the consultation period. Accepting appointments is a means of mitigating the negative impact of noshows while increasing modeling complexity due to the dynamic random arrival of nonappointment patients ^{[53]}. Appointment scheduling methods are categorized into online and offline ^{[54]}. In the offline method, arranged once all requests have been received, whereas in the online method, patients are promptly scheduled after requests arrive.
2.3.2. Tactical Decisions
The primary purpose of approaching the decision problem at the tactical level is to characterize the system to optimize resource utilization and the integrity of the consultation service. For example, in allocating capacity among various groups, the decision should consider factors such as the needs of each patient group, prioritization, probability of absence, revenue per patient group, and patient and physician preferences ^{[55]}, which affect the absence rate and hence the system efficiency. A decrease in the scheduling window results in a reduction of indirect wait time, consequently leading to decrease the absence rate. This enables a more effective use of the clinic’s capacity. Excessive constraints on scheduling windows may result in a reduced patient count, leading to a decline in clinic revenue ^{[56]}. Issues such as appointment intervals (slots), block size, panel size, etc., are essentially capacity allocation issues as well, affecting tacticallevel decisions ^{[57]}^{[58]}^{[59]}.
2.3.3. Operational Decisions
Operational decisions are associated with plans at the individualpatient level. Rulebased approaches (RBA) and optimizationbased approaches (OBA) are used to determine these decisions
^{[55]}. RBA refers to a set of instructions having associated rules and parameters, but it does not guarantee the realization of optimal performance compared to OBA. Whereas OBA specifies the level of operational decisions, its goal is to attain globally optimal answers for operational decisions
^{[60]}.
3. Optimization Framework
3.1. Optimization Objective
3.1.1. Societal Benefit
Many studies in the literature on AS have been devoted to minimizing pathway completion time or maximizing patient satisfaction, which leads to better societal benefits and is the primary goal that hospital management needs to follow. The key performance indicators for minimizing the time to complete all tasks include the average waiting time of patients (WAIT), the average idle time of physicians (IDLE) and the average overtime of physicians (OVER).
Dharmadhikari et al. ^{[61]} used performance metrics of average rewards per patient to assess the effectiveness of the proposed block scheduling strategy with prioritization. Cordier et al. ^{[62]} developed algorithmic tools to construct oneday schedules and optimize these schedules to optimize the length of patient stay. Nazanin et al. ^{[63]} conducted case studies for different healthcare settings and selected the most effective scheduling model that fits the case in terms of the balance between three types of metrics related to patient appointment scheduling systems: patient satisfaction, scheduler utilization, and scheduling system cost. Accessibility was a factor of patient satisfaction, measured by the average waiting time before connecting to the dispatch program and the average duration of call.
3.1.2. Economic Performance
The appointment scheduling system is a potentially useful tool for reducing health management costs and maximizing medical benefits. Improving system reliability and cost savings are the main ideas of optimization
^{[64]}^{[65]}^{[66]}^{[67]}. Profit maximization is becoming a major research objective due to the need for cost efficiency and facing budget cuts. Some hospitals maximize profits by rising the number of patients scheduled and maximizing contribution margins. ElSharo et al.
^{[68]} modeled an overbooking scheduling model for multiprovider practices to optimize patient overbooking and maximize expected profits.
3.1.3. Resource Utilization
With limited healthcare resources, clinics are under tremendous pressure to the increasing demand. Therefore, rational capacity allocation is one of the main goals of AS. Previous papers on outpatient capacity assignment can be divided into two broad categories. One category is where the overall capacity is a constant, the hospital must assign limited medical capacity to various types of patients. For instance, Nguyen et al. ^{[69]} presented a mixedinteger planning model with the aim of minimizing the maximum demand capacity to plan the demand of outpatient physicians to achieve the service goal of patient appointment lead time. The other category, where the capacity is a variable that needs to be solved in conjunction with the allocation scheduling problem, is categorized into static and dynamic cases. The former means that the decision is made before the session, e.g., Zeng et al. ^{[70]} investigated the appointment booking problem for heterogeneous patients. The features of optimal scheduling with heterogeneous patients are determined, and a method of local search algorithm is proposed to for finding the locally optimized scheduling. The latter means that appointments are made sequentially, and when a patient calls in, capacity allocation is conducted online, and the hospital needs to decide how much capacity is available for each time slot.
3.1.4. Other Objectives
In general, the literature on optimization studies of AS systems covers many aspects, as well as the optimization of objectives through other aspects to obtain better social and economic effects.
Savelsbergh et al.
^{[71]} investigated methods based on optimization and cohorts to SA for patients in a chronic disease management program. The objective was to minimize the overall probability of a patient entering an uncontrolled health state. The approach considers transitions in disease control since the last appointment time and the probability of the patient not attending the appointment. Ozen et al.
^{[59]} used the probability of demand exceeding capacity as a measure of access capacity. Formulating the problem of minimizing the maximum overflow of a multimedicine practitioner clinic as a nonlinear integration programming problem describes how the frequency of overflow varies from physician to physician and demonstrates how these supply and demand imbalances can be minimized in the long run using realworld data from primary care practices.
3.2. Decision Variable
About the optimizing appointment scheduling’s study, the decision variables for optimization show the strategy and actions taken to enhance the objectives
^{[72]}. Appointment time is one of the common decision variables in the AS problem. Tito et al.
^{[73]} considered whether patient absence was affected by appointment time using arrival time as the decision variable and investigates a stochastic optimization problem with a random distribution of service times and patient decisiondependent noshow behavior. Solutions are given for different patterns of absenteeism behavior, and it is shown that disrupting the hypothesis of a fixed probability of attendance greatly alters the scheduling scheme.
3.3. Constraints
Various optimization decisions about appointment scheduling systems will have different constraints. Optimization studies of ASs are often inseparable from the optimization of operational costs as well as time from the perspective of economic or social benefits
^{[74]}. Considering the minimum cost of AS operation and the minimum waiting time or the minimum physician overtime time, the constraints consist of appointment sequence, resource capacity, time constraints, etc.
4. Optimization Algorithms
Numerous studies have been undertaken to determine the optimal allocation of AS systems to reduce operational and time costs, improve patient satisfaction and system reliability dependability. Various algorithms are applied to the optimization of AS systems, with genetic algorithms (GAs) being the most utilized. For instance, Braune et al. ^{[75]} proposed a combination of GAs and Monte Carlo simulation to heuristically solve a stochastic optimization model developed for planning the appointment times of healthcare units under uncertain activity durations, allowing to minimize the waiting time of patients while maximizing the use of resources. Fan et al. ^{[76]} considered patient preferences for highly qualified general practitioners and specialist doctors. By analyzing real data from hospital outpatient clinics, a behavioral pattern was derived in which the patient’s tolerance limit adapted to the expected waiting time. A simulation optimization framework for maximizing clinic benefits and minimizing patient dissatisfaction is proposed. Utilizing multiobjective optimization and a genetic algorithm, a simulation budget allocation approach is integrated to derive an approximate Pareto scheme for joint capacity planning and patient scheduling across multiple servers.
In addition, the key to the appointment dilemma is the challenge of solving the multiobjective optimization problem; therefore, many decisions need to be made using a multiobjective evolutionary algorithm. Mohammad et al. ^{[77]} improved the quality of operational efficiency and healthcare quality by writing a MOPSO algorithm and introducing a MOPASS architecture. Ali et al. ^{[78]} investigated a multicriteria approach in appointment scheduling by WOA. optimization for hospital management quality and patient satisfaction.
There are some other methods to solve this problem. Garaix et al.
^{[79]} proposed a heuristic to calculate the order in which patients receive treatment at outpatient chemotherapy centers called the GRASP algorithm. It optimizes the facility’s closing time and overtime working time. It can reach nearoptimal solutions quickly and the performance of the patientlisting strategy is comparable to more complex scheduling strategies.
4.1. Genetic Algorithm
Genetic algorithms (GAs) offer an efficient approach to optimizing complex systems. Previous research indicates that many scholars have employed GAs to address optimization problems in the scheduling fields. For example, Squires et al. ^{[80]} proposed a new genetic algorithm designed for scheduling repetitive transcranial magnetic stimulation (rTMS) appointments. The mentioned algorithm (LSWTGA) combines a novel survivor selection strategy with heuristic population initialization. The objective of the algorithm is to enhance the operational efficiency of medical centers by optimizing the scheduling of repetitive transcranial magnetic stimulation (rTMS) appointments.
4.1.1. Objective Function and Constraint
The primary goal of the initial aim in the experiment is to minimize the job processing time expressed as 𝐶max and aim to minimize weighted flowtime 𝐹𝑤 secondly. The problem can be under the category of minimizing make span in a parallel machine scenario, where job processing times are deterministic, and preemption is not allowed.
$$\begin{array}{c}P\parallel {C}_{max}\text{}P\parallel {F}_{w}\end{array}$$
$$\begin{array}{c}\mathrm{min}\text{}{C}_{max}\end{array}$$
$$\begin{array}{c}{F}_{w}={\displaystyle {\displaystyle \sum}_{j=1}^{x}}{w}_{j}{F}_{j}\end{array}$$
$$\begin{array}{c}\mathrm{min}\text{}{F}_{w}\end{array}$$
where
$$\begin{array}{c}{F}_{j}={C}_{j}{r}_{j}\end{array}$$
In this formula,
𝑃 is a group of patients waiting for a treatment,
𝐹𝑗 denotes the flowtime of patient
𝑃𝑗;
𝐶𝑗 is the time to finish the treatment for
𝑃𝑗 and
𝑟𝑗 is the release time of the job.
4.1.2. Optimization Process
The study presents the new genetic algorithm used. Drawing inspiration from evolution, the genetic algorithm relies on natural selection to choose the most suitable chromosomes, as determined by a fitness function, for the reproduction phase of the genetic algorithm. Figure 2 illustrates the flowchart of the optimization algorithm.
Figure 2. Flowchart of genetic algorithm modules.
4.2. Whale Optimization Algorithm
The WOA algorithm is a metaheuristic algorithm designed with both subtlety and character, which is derived from simulating the hunting behavior of humpback whale groups in nature and realizes the purpose of optimizing search through the process of searching, pursuing, and attacking prey by the whale group. The WOA literature has been widely used in solving various of optimization problems, and Ali et al. ^{[78]} explores the multicriteria in AS were analyzed using both algorithms, WOA and NSGA techniques. They are computed using various assumptions to meet the requirements and aspects associated with WOA and NSGA.
4.2.1. Optimization Model
Scheduling and counseling patients for scheduling to the hospital is the issue discussed. Each hospital section has a varying number of operators to handle distinct operations. Moreover, each capable of providing specific services. In this system, there are n patients, categorized as either emergency or general patients. There are several surgeries for each patient that must be performed in different departments. In addition to this, it may diagnose a patient as an emergency at the time of planning. Emergency patients are usually visited earlier than general patients and are given precedence (fairness). After doing something such as seeing a doctor, the diagnosis depending on the patient’s condition, in which case the patient is referred to an inpatient unit with limited beds.
4.2.2. Objective Function
The objective function is to minimize the average total weighted patient time and to reduce dissatisfaction because of increased waiting time for patients.
$$\begin{array}{c}\mathrm{min}\text{}{c}_{w}=\frac{1}{{\displaystyle {{\displaystyle \sum}}_{i=1}^{n}}{w}_{i}}{\displaystyle {\displaystyle \sum}_{i=1}^{n}}\left({w}_{i}.C{N}_{i}\right)\end{array}$$
$$\begin{array}{c}\mathrm{min}\text{}Z=\rho {\displaystyle {\displaystyle \sum}_{i=1}^{n}}\left(C{N}_{i}{r}_{i}\right)\end{array}$$
4.2.3. Constraint
Examination or processing of each patient’s procedure is exclusive in one location on one ward, as shown in the formula below. And for the restriction in a sequencing assured to prevent patients from being assigned to a segment of the surgery when another area is empty, as shown in the Formulas (33) and (34).
$$\begin{array}{c}{\displaystyle {\displaystyle \sum}_{m=1}^{M}}{\displaystyle {\displaystyle \sum}_{l=2}^{L}}{x}_{ijlm}=1,j=1,\dots ,{h}_{i},i=1,\dots ,n,\end{array}$$
$$\begin{array}{c}{\displaystyle {\displaystyle \sum}_{i=1}^{n}}{\displaystyle {\displaystyle \sum}_{j=1}^{{h}_{i}}}{x}_{ijlm}\le {\displaystyle {\displaystyle \sum}_{i=1}^{n}}{\displaystyle {\displaystyle \sum}_{j=1}^{{h}_{i}}}{x}_{ij\left(l1\right)m,}m=1,\dots ,M,l=3,\dots ,L,\end{array}$$
where
x is the Appointment System Decision Variables and is equivalent to 1 if the action
𝑂𝑖𝑗 is performed in section
𝑚𝑡ℎ at position
𝑖𝑡ℎ . It is also important to consider the indexes used for appointments, appointment durations, association variables, etc.
4.2.4. Model Solving
The study solves the model by introducing a local search operator to optimize the solution, using the stochastic WOA nature of the metaheuristic algorithm. The WOA begins with stochastic solutions. Depending on each search factor, the search agent arbitrarily changes according to the optimal solution. The position of the task agent can be updated through two methods. If A > 1, a random search agent is chosen; otherwise, the optimal solution is selected. The whale can transition between two types of motions, either spiral or rotational, depending on the pvalue. Eventually, the algorithm concludes when it attains a predefined satisfaction criterion, where x* represents the best solution, as shown in Figure 3.
Figure 3. Proposed flowchart for the whale optimization algorithm.
4.3. Tabu Search Algorithm
4.3.1. The Integer Programming Model in a Definitive Model
The optimization objective is reducing waiting periods and the cost of completion times to a minimum. Every patient went through three phases of initial admission and surgery and recovery phases of surgery.
$$\begin{array}{c}\mathrm{min}{\displaystyle {\displaystyle \sum}_{j}}{\displaystyle {\displaystyle \sum}_{t}}{\displaystyle {\displaystyle \sum}_{p}}{\gamma}_{p}{q}_{j,t,p}+{\beta}_{m}\end{array}$$
where 𝑞 denotes the queue limit, 𝛾 is the resource capacity content, and 𝛽 denotes the patient visit or procedure completion time. Meanwhile, patient queue balance as well as resource capacity versus the number of patients to be served are constraints of the appointment system.
4.3.2. Algorithm Optimal Progress
The random solution called at the beginning of the algorithm is 𝑥0. And the bestfound neighbor solution, 𝑥′, is named as a pivot. Tabu tenure comes into play to navigate away from local optima throughout the search process. An iterative update of the list is implemented to enable the algorithm to adapt to the status of the search. This methodology ensures the comprehensive exploration of the entire solution space while simultaneously addressing the objectives of intensification and diversification. Additionally, in specific instances, the aspiration criterion is applied to supersede the Tabu list. Figure 4 illustrates the proposed TS algorithm, where X* represents the best solution.
Figure 4. The flowchart of the Tabu search algorithm.
The term of Tabu was determined from some preliminary experiments. The taboo retention period specified the upper limit for the number of iterations. The maximum computation time is set as the criterion for terminating the algorithm when no improvement is observed within the specified number of iterations. The second method uses integer programming with stochastic models, which are executed separately and then compared.
4.4. Other Heuristic Algorithm
4.4.1. Problem Description
A heuristic optimization algorithm is an intuitively or empirically constructed algorithm that provides a viable solution for the combinatorial optimization problem at an acceptable cost, considering computational time and space constraints. This means that the heuristic algorithm solves the problem empirically or according to some rules, and the solution to the problem is not necessarily optimal but is likely to be approximate (or near optimal). Akbarzadeh et al. ^{[80]} proposed a threephase heuristic algorithm for constructing highquality feasible solutions using column generation, which is further improved by local branching. The surgical case replanning and scheduling problem with resource rescheduling is investigated in the presence of a chunk release time when the OR planners aim to achieve equilibrium between the capacity and demand for operating rooms. The following equation involves four components that reflect the benefits, resulting in weighted sums of various metrics.
$$\begin{array}{c}Min\text{}\omega =\alpha \frac{{\displaystyle {{\displaystyle \sum}}_{idj}}{w}_{id}\times A{P}_{idj}\times {x}_{j}}{{\alpha}^{Max}}+\beta \frac{{\displaystyle {{\displaystyle \sum}}_{i}}W{T}_{i}}{{\beta}^{max}}+\gamma \frac{NurRe}{{\gamma}^{max}}+\delta \frac{SurRe}{{\delta}^{max}}\end{array}$$
where the initial component compels the model to allocate surgical cases to an appropriate day. Following this, the second component seeks to minimize waiting time. Subsequently, the next component aims to minimize the overall nurse rescheduling cost. Finally, the last component focuses on minimizing the deviation of the surgeon’s schedule from the Master Surgery Schedule (MSS). The weights assigned to these different objective functions are relative and collectively sum to 1, i.e., α + β + γ + δ = 1.
4.4.2. Constraint
There needs to be a requirement for nurses to perform only one procedure at a time, and to assign procedures to nurses only if they have been assigned a shift. In fact, a surgeon is restricted to one operating room at any given time, and each surgery is limited to being conducted only once.
$$\begin{array}{c}{\displaystyle \sum _{j}}N{T}_{ntdj}\times {x}_{j}\le {\displaystyle \sum _{v}}n{x}_{nvd}\end{array}$$
$$\begin{array}{c}{\displaystyle \sum _{rj}}S{X}_{sbrdj}\times {x}_{j}\le 1\end{array}$$
$$\begin{array}{c}{\displaystyle \sum _{dj}}A{P}_{idj}\times {x}_{j}=P{X}_{i}\end{array}$$
In Equation (19), 𝑁𝑇𝑛𝑡𝑑𝑗 denotes the case where nurse n received the task for schedule 𝑗 at time t on day 𝑑, 𝑥𝑗 indicates whether the scheduling is accepted or not, 𝑛𝑥𝑛𝑣𝑑 indicates whether nurse n worked on shift 𝑣 on day 𝑗; 𝑆𝑋𝑠𝑏𝑟𝑑𝑗 denotes whether surgeon s is assigned to the rroom b area on day d of program 𝑗; 𝐴𝑃𝑖𝑑𝑗 denotes if surgical case i is included in schedule 𝑗, day 𝑑; and 𝑃𝑋𝑖 is the decision variable implies that the surgery is performed within the time frame under consideration.
4.4.3. Solution Methodology
The solution procedure named Column Generation and Local Branching Heuristic (CLH) is proposed to address the integrated problem. Figure 5 provides an overview for the solution procedure, consisting of three distinct steps. Firstly, the CLH algorithm employs a computationally feasible column generation procedure to address the impracticality of generating all possible OR schedules directly. If the solution is an integer, it is optimal; otherwise, transforming fractional solutions into feasible integer solutions offers an upper bound on the optimal solution. If the upper bound matches the lower, the optimal solution is identified. If not, the optimal upper bound is used as input for an improvement step, using local branches to narrow the optimality gap.
Figure 5. Summary of the Column Generation and Local Branching Heuristic.
This entry is adapted from the peerreviewed paper 10.3390/axioms13010016