Next Article in Journal
Intestinal Exposure to Food-Derived Protease Inhibitors: Digestion Physiology- and Gut Health-Related Effects
Previous Article in Journal
Preliminary Assessment of Muscle Activity and Muscle Characteristics during Training with Powered Robotic Exoskeleton: A Repeated-Measures Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Optimization between Physician Satisfaction and Hospital Profit in Cross-Hospital Scheduling—A Case Study of Some Hospitals in Taiwan

1
Department of Industrial Management, National Pingtung University of Science and Technology, Neipu 91201, Taiwan
2
Department of Electrical Engineering, National Kaohsiung University of Science and Technology, Kaohsiung 807618, Taiwan
*
Author to whom correspondence should be addressed.
Healthcare 2021, 9(8), 1004; https://doi.org/10.3390/healthcare9081004
Submission received: 11 June 2021 / Revised: 21 July 2021 / Accepted: 30 July 2021 / Published: 5 August 2021

Abstract

:
In recent years, the majority of the population has preferred to go to large hospitals regardless of the severity of their illnesses, resulting in a waste of medical resources. In view of this situation, the government has proposed a cross-hospital integration plan to promote the integration of medical resources. Hospitals that provide support can not only increase their income but also extend their medical coverage to other regions and get wide access to more patients. While previous studies mainly focused on the internal shift scheduling of hospitals, this study took into account both the internal hospital and the support to branch hospitals and particularly explored the financial benefits generated by the provision of support and the satisfaction of physicians on shift scheduling. Decision makers can give different weight values according to the management needs and then determine the most appropriate physician shift schedule according to the final decision value. The shift-schedule-building system developed in this study could be used to quickly calculate the most appropriate shift schedule according to the actual needs, which could replace the time-consuming method of manual scheduling and improve physician satisfaction and hospital financial income.

1. Introduction

Taiwan implemented the national health insurance system on 1 March 1995 to provide medical and health care services to its people. The system has contributed to the country’s medical development and realized the concept of public sharing and equal access to medical care. However, this has also led to a substantial increase in medical expenditures that is far beyond the scope of the originally approved premium. To solve this problem, the National Health Insurance Administration has introduced a global payment system to control its financial budget. In order to foster the medical classification, the government encourages hospitals to cooperate at different levels to provide integrated care. Meanwhile, the government has also implemented a referral system through the national health insurance to guide patients to consult grass-roots hospitals for treatments on small illnesses and large hospitals for serious illnesses so as to achieve the objective of reducing the waste of medical resources. Cross-level cooperation can not only promote the integration of the medical system and reduce the competition between hospitals but also promote the physicians of large- and medium-sized hospitals to support community hospitals and improve the quality of medical services in the communities so that medical resources can be reasonably and effectively distributed and allow the public to visit hospitals nearby and enjoy medical services of the same quality.
Through physician support, both large and community hospitals can achieve mutual benefit. On the one hand, a physician’s main hospital can earn additional income from the physician’s support to branch hospitals; on the other hand, branch hospitals can improve their medical quality and thus attract more patients, which can increase their profits. However, under this mode, physicians will have to provide outpatient services in two or more hospitals. Without a proper shift schedule, the physicians may have to work shifts in different hospitals on the same day, which will cause the physicians to suffer from fatigue due travel or be unable to catch up with the service time, thus affecting the rights and interests of patients. Therefore, in the actual scheduling of hospitals, decision makers should not only consider a single objective but also take into account of other objectives or constraints, such as hospital profits and physician satisfaction. However, increasing the hospital income from providing support to branch hospitals will affect the physicians’ satisfaction with the shift schedule. Physicians with senior qualifications (who have served more than 15 years) and rich experiences can bring more income to their own hospitals by providing support to branch hospitals, but more senior physicians will be arranged to serve in the same hospital from the perspective of medical ethics. The above situation will increase the complexity of scheduling. Therefore, this study adopted the integer programming method to solve the problem of multi-objective scheduling. On the one hand, a computer was employed to replace traditional manual scheduling and improve the efficiency of scheduling. On the other hand, a fair and reasonable shift schedule for physicians was developed to achieve the objectives of maximizing hospital income and physician satisfaction.
The way of physician support will affect the physician-scheduling results under different objectives. The advantage is that it enables the hospital to receive additional income and improve profits, while the disadvantage is that it will cause the physicians to work in different hospitals, thus making them suffer from fatigue due to travel. The purpose of this study was to adopt the integer programming method to explore the impact of physicians’ schedules on the financial revenue of the hospital and the physician satisfaction with the scheduling as well as to find the most satisfactory solution that meets both objectives at the same time so as to provide decision makers with an optimal shift schedule.

2. Literature Review

2.1. Linear Programming

Linear programming is used to construct a mathematical model through the development of objectives and constraints, while the integer programming method in operations research is used to solve linear or nonlinear problems of the integer value of decision variables. Generally, integer programming is regarded as a special case of linear programming that is applied to solve many practical problems, such as assignment, location, transportation, and logistics problems, as well as shift and course scheduling. In the field of transportation and logistics, distribution mostly takes minimizing storage and transportation costs as the goal. By using the integer programming method, it is possible to accurately calculate the optimized distribution route and warehouse location [1] or arrange the optimal number of vehicle trips to reduce operation costs [2]. Therefore, the integer programming model is helpful in supply-chain-network management because it considers the combination of each manufacturing plant, production capacity, transportation, and other links [3,4] so as to optimize the network configuration and reduce operating costs. Effective personnel arrangement has become the most competitive method in service entities. In the United States, the postal-service industry has applied pure integer linear programming to achieve the goal of minimizing personnel costs per day without violating labor contracts or government regulations [5]. The complexity of distribution is just like the scheduling of shifts between hospitals, which involves multiple clinics and objectives. As different types of medical clinics will have different personnel needs, integer programming can be used to achieve the optimal distribution of personnel according to people’s preferences and after taking into account the distance between people and clinics, the time, and the service demand [6]. Thus, integer programming is not only used in the field of transportation and distribution but is also popularly applied to personnel scheduling. In the aviation industry, Abara applied the integer linear programming model to realize the assignment of two or more crews to a single flight schedule [7]. The most important goal of airline crew matching is to minimize the expenses related to the assignment. For example, in order to reduce operating costs, Air France uses the integer nonlinear multi-commodity network flow model to generate feasible flights and uses the branch-and-bound method to find solutions that will reduce operating costs [8].

2.2. Scheduling Issues

Personnel scheduling usually deals with multi-task assignments that must satisfy some constraints on multiple personnel at the same time. For example, by using the 0–1 linear programming, Azaiez and Sharif found out that with appropriate personnel, nursing skills can be reasonably applied to consecutive services and unnecessary additional costs can be avoided [9]. For example, overtime work can be arranged to meet the hospital’s objectives. Therefore, integer programming has an extensive scope of application. It can be combined with systematization or various algorithms to improve the execution efficiency. Its purpose is to optimize the combination of problems, meet objectives and various constraints, achieve appropriate assignment and planning, and reduce the planning time [10]. Personnel scheduling can achieve the effective management of human resources by arranging appropriate personnel for the required work at the right time so that the needs and objectives of the unit can be met [11]. Meisels and Schaerf defined scheduling as an effective shift combination that has personnel assigned in different shifts, with each shift usually based on a fixed time [12]. Many scheduling cases are needed to meet work needs with minimal cost or maximum benefits [13,14]. With the improvement of workers’ awareness, scheduling has gradually turned to the construction of a complete and proper shift schedule by taking into account factors with multiple natures, such as rationality and fairness, as well as the expectations of employees, rotating shifts, and vacation time [15,16]. Different industries pursue the reasonability and efficiency of work by improving the scheduling mode. The aviation company constructed the mathematical model [17] of flight attendants’ scheduling through integral programming and applied sample average approximation (SAA) algorithm to solve the scheduling issue of ballooning [18]. The integral programming could also be used to solve the dispatching of bus shifts and the meal problems of drivers [19,20]. The scheduling of policemen belongs to the scheduling issue of ordinary personnel. Besides the discussion of the patrol area [21], the questionnaire was adopted to understand different demands of each policeman and formulate the service schedule that meets various demands of the personnel [22].
In the medical field, the actual work and staffing of physicians is quite complex because they need to participate in informal cooperation and support in case of an emergency [23,24]. As a result, it is difficult to make general rules. Doctors generally have personal and special contractual obligations. Therefore, most doctors’ schedules only consider doctor satisfaction. Doctors at different positions in various departments will have different types of work and must face the various work-performance indicators from the management departments [25]. Therefore, a good schedule is very important in medical institutions. If there is no proper arrangement, it may cause the interval and delay of medical service times or the cancellation of operations, thus reflecting the excess cost of the hospital and leading to the loss of the hospital [26].
Nowadays, patients have increasingly higher demands for medical services, which leads to increasingly heavier workloads and pressure for medical staff. Therefore, it is important to arrange a reasonable division of labor, emphasize the diversity of work, and meet the reasonable needs of personnel. However, in most medical institutions, the objectives of medical staff scheduling are mainly to ensure continuous services and to meet the scheduling strategy of the organization while at the same time using minimum manpower allocation to avoid the waste of manpower, which can reduce unnecessary overtime work and other additional expenses and thus reduce the labor cost of the hospital [9]. Beaulieu et al. made a shift schedule for physicians in an emergency room using the multi-objective integer programming model, which could accommodate such rules as seniority and personal preferences [27]. However, scheduling needs to consider many factors, making it an NP-Hard issue [28]. Reasonable scheduling and work rotation can improve work performance and reduce employee fatigue and work injury [29]. Therefore, a shift schedule that can evenly share the fatigue and meet the holiday preferences of each employee can achieve the goal of reducing the maximum fatigue value. In addition, the quality of medical staff scheduling also involves the level of labor cost and further affects the operation level and quality of patient care [30].
Mathematical programming methods are not the only solution to hospital manpower scheduling. For example, Ferrand et al. constructed an eight-week shift schedule system for physicians-in-charge through linear programming [31]. Different methods of hospital manpower scheduling have been documented in many literatures. Puente et al. used the genetic algorithm to solve the average shift schedule of emergency room medical staff in 24-h shifts [32]. Tsai and Li applied the genetic algorithm to the two-stage mathematical model and combined it with interactive web technology to effectively solve the shift schedule of medical staff and provide more respect for self-determined schedules, which could increase the staff’s satisfaction [33]. Finally, Topaloglu and Selim applied fuzzy theory to deal with the uncertainty between the target value of hospital management and nurses’ preferences for duty [34].
According to the above literature, it could be found that it is common to apply integer programming to personnel scheduling in the medical system. At present, most scheduling is based on preferences or to minimize the situation of redundant or insufficient personnel so as to reduce personnel costs and arrange a reasonable schedule. The above literatures on scheduling only focused on single goals, such as preferences or the fair number of vacations and shifts, but they did not take into account the need for personnel scheduling in multiple hospitals or the impact of the provision of medical services by personnel with different qualifications in different hospitals on hospital revenue, all of which are related to a hospital’s operating objectives or operation mode. Therefore, this study focused on the rationality of scheduling to meet the scheduling objectives for hospital revenue and physician satisfaction so as to provide decision makers with an optimal physician schedule.

3. Research Method

3.1. Definition of Variables

Name of set
JSet of physicians
KSet of weekdays
LSet of shifts
MSet of outpatient rooms
NSet of hospitals
Parameter
jCode of physician: senior physician, j = 1,2,…,Na; junior physician, j = Na + 1, Na + 2,...,J
kWeek: k = 1,2,…,K (k = 1, Monday; k = 2, Tuesday…, k = 6, Saturday)
lTime: l = 1,2,…,L (l = 1, morning shift; l = 2, afternoon shift; l = 3, evening shift)
mmedical service: m = 1,2,…,M; M = max (Nm1, Nm2, Nm3)
nhospital: n = 1,2,…,N (n = 1, main hospital; n = 2, branch; n = 3, nursing home)
Definition of symbols
PZnThe maximum income under scheduling scenario n
PRWnThe relative weight of the income under scheduling scenario n
SaPhysician satisfaction with scheduling of inconsecutive shifts in the same hospital
SbPhysician satisfaction with scheduling of consecutive shifts in the same hospital
ScPhysician satisfaction with scheduling of inconsecutive shifts in different hospitals
SZnMaximum satisfaction under scheduling scenario n
SRWnRelative weight of maximum satisfaction under scheduling scenario n
DVnDecision value of scheduling under scenario n
DWDecision weight value
MDVnMaximum decision value
NwOutpatient service demand in one week
MjPhysician j’s outpatient number in one week
DjkPhysician j needs to make outpatient surgery clinic on k (day of the week)
Nd1Minimum number of shifts in one day
Nd2Maximum number of shifts in one day
Nm1Number of outpatient rooms in the main hospital
Nm2Number of outpatient rooms in the branch
Nm3Number of outpatient rooms in the nursing home
Ns1Total number of senior physicians who support the branches and nursing homes
Ns2Total number of junior physicians who support the branches and nursing homes
Decision Variable
XjklmnWhether physician j takes the shift l of outpatient room m in hospital n on day k (0 indicates “no”; 1 indicates “yes”)
YjkWhether physician j works on day k (0 indicates “no”; 1 indicates “yes”)

3.2. Description of Physician Scheduling Problem

In order to integrate regional medical resources, hospitals of different scales will take a business model of cross-hospital integration. Large hospitals will assign physicians to smaller hospitals to support their medical work, which can not only increase the medical level of the branch hospitals but also increase the number of patients in the main hospital through a referral system. Providing support to branch hospitals can increase the income of the main hospital. However, because physicians have to serve across hospitals, when there is a lack of transportation or medical equipment, management must consider physician satisfaction with providing cross-hospital services.
When experienced physicians stay in branch hospitals to support medical services, they can attract more patients to visit the supported hospitals; therefore, the supported hospitals are willing to hire senior physicians at a high cost. The number of senior or junior physicians assigned will affect the income of the supporting hospitals. According to the questionnaire survey, the ranking of physician satisfaction on three types of scheduling (from high to low) was: (1) inconsecutive afternoon shifts in the same hospital; (2) consecutive afternoon shifts in the same hospital; and (3) inconsecutive afternoon shifts in different hospitals. However, due to the traffic problems in different hospitals, scheduling consecutive afternoon shifts in different hospitals and similar scheduling strategies are also avoided. In order to respect workplace ethics, management can give a higher weight value of satisfaction to senior physicians. Other management constraints are explained in the constraint of linear programming in this paper. This study constructed a 0–1 integer programming model that could allow management to plan the cross-hospital scheduling of physicians according to prioritization between medical service income and satisfaction. This scheduling model could help management make the most appropriate scheduling that balances support income (income from providing supporting services) with satisfaction within the shortest time.

3.3. Construction and Description of the Physician-Scheduling Model

The scheduling model of this study was constructed through 0–1 integer programming based on hospital support income and physician satisfaction. Managers could use the model to set the relative weight of support income and satisfaction according to the practical needs and then find out the most appropriate physician schedule in the shortest time.

3.3.1. Physician satisfaction with the scheduling model

Objective function: Maximum satisfaction
Max Z = Sa + Sb + Sc
Equation (1) is the objective function of physician satisfaction with scheduling. This function consisted of three scheduling scenarios, including inconsecutive afternoon shifts in the same hospital, consecutive afternoon shifts in the same hospital, and inconsecutive afternoon shifts in different hospitals, which were multiplied by the satisfaction of the relative weight.
To calculate the weight value, this study adopted the SMART-ROC equation, as shown in Equation (2):
W i = 1 n k = i n 1 k
where n indicates the number of attributes and k indicates the rank order of preference.
Using the SMART-ROC method, physician satisfaction with scheduling was investigated and ranked, and the weight value was calculated according to the rank of the physician satisfaction. The obtained weight value was multiplied by 100 and rounded off to the integer part for convenience of calculation. In this study, the rank order of satisfaction was most satisfied (three points), sub-satisfied (two points), and least satisfied (one point). The rank order of scheduling was Sa (inconsecutive shifts in the same hospital), Sb (consecutive shifts in the same hospital), and Sc (inconsecutive shifts in different hospitals). The method to calculate the weight of satisfaction with scheduling was as shown in Equations (3)–(5):
Calculation of the weight of scheduling Sa:
W 1 = 1 3 ( 1 1 + 1 2 + 1 3 ) * 100 = 61
Calculation of the weight of scheduling Sb:
W 2 = 1 3 ( 1 2 + 1 3 ) * 100 = 28
Calculation of the weight of scheduling Sc:
W 3 = 1 3 ( 1 3 ) * 100 = 11
The following section describes the mathematical patterns of various scheduling scenarios within the objective function.
(1) Physician satisfaction with the scheduling scenario of inconsecutive shifts in the same hospital.
Equation (6) shows the total number of inconsecutive shifts of senior physicians and junior physicians in the same hospital, multiplied by the weight value of individual physicians:
S a = 122 j = 1 N a k = 1 K [ ( m = 1 M X j k 1 m 1 + m = 1 M X j k 3 m 1 ) # 2 , 1 , 0 ] + 61 j = N a + 1 J k = 1 K [ ( m = 1 M X j k 1 m 1 + m = 1 M X j k 3 m 1 ) # 2 , 1 , 0 ]
where
[(value)#2,1,0] means that when value = 2, [] = 1; otherwise, [] = 0.
During situations where physicians take excessive time performing a medical service, arranging such physicians to continue working will affect the rights and interests of the next patients or cause the physicians to be unable to rest, thus affecting the quality of the medical service. However, when arranging the schedule, it is necessary to consider the perspective of medical ethics. Therefore, in the case of inconsecutive shifts in the same hospital, senior physicians were given twice the weight value of junior physicians, i.e., 122, while the weight value of junior physicians was 61, so that priority would be given to the satisfaction of senior physicians with the scheduling scenario.
(2) Physician satisfaction with the scheduling scenario of consecutive shifts in the same hospital.
Equation (7) is the total number of consecutive shifts of senior physicians and junior physicians in the same hospital, multiplied by the weight value of individual physicians.
S b = 56 ( j = 1 N a k = 1 K [ ( m = 1 M l = 1 2 X j k l m 1 ) # 2 , 1 , 0 ] + j = 1 N a k = 1 K [ ( m = 1 M l = 1 2 X j k l m 2 ) # 2 , 1 , 0 ] + j = 1 N a k = 1 K [ ( m = 1 M l = 2 3 X j k l m 1 ) # 2 , 1 , 0 ] ) + 28 ( j = N a + 1 J k = 1 K [ ( m = 1 M l = 1 2 X j k l m 1 ) # 2 , 1 , 0 ] + j = N a + 1 J k = 1 K [ ( m = 1 M l = 1 2 X j k l m 2 ) # 2 , 1 , 0 ] + j = N a + 1 J k = 1 K [ ( m = 1 M l = 2 3 X j k l m 1 ) # 2 , 1 , 0 ] )
where
[(value)#2,1,0] means that when value = 2, [] = 1; otherwise, [] = 0.
Due to the service times of the hospital, there may be cases where physicians need to take consecutive shifts. However, when arranging the schedule, it is necessary to consider the perspective of medical ethics. Therefore, in the case of consecutive shifts in the same hospital, senior physicians were given twice the weight value of junior physicians, i.e., 56, while the weight value of junior physicians was 28, so that priority would be given to the satisfaction of senior physicians with the scheduling scenario.
(3) Physician satisfaction with the scheduling scenario of inconsecutive shifts in different hospitals.
Equation (8) is the total number of inconsecutive shifts of senior physicians and junior physicians in different hospitals, multiplied by the weight value of individual physicians.
S c = 11 ( j = 1 N a k = 1 K [ ( m = 1 M X j k 3 m 1 + m = 1 M X j k 1 m 2 ) # 2 , 1 , 0 ] + j = 1 N a k = 1 K [ ( m = 1 M X j k 3 m 1 + m = 1 M X j k 1 m 3 ) # 2 , 1 , 0 ] ) + 22 ( j = N a + 1 J k = 1 K [ ( m = 1 M X j k 3 m 1 + m = 1 M X j k 1 m 2 ) # 2 , 1 , 0 ] + j = N a + 1 J k = 1 K [ ( m = 1 M X j k 3 m 1 + m = 1 M X j k 1 m 3 ) # 2 , 1 , 0 ] )
where
[(value)#2,1,0] means that when value = 2, [] = 1; otherwise, [] = 0.
In view of physicians’ support of services in different hospitals and considering the inconvenience faced by physicians in providing services in branch hospitals or the possibility that they will be unable to catch up with consecutive service shifts, this scheduling mode was developed to ensure that physicians could have enough time to rest. As physicians are most unsatisfied with the scheduling scenario of shifts in different hospitals, this study gave lower weight values than those in the case of shifts in the same hospital. However, when arranging the schedule, it is necessary to consider the perspective of medical ethics. Therefore, in the case of inconsecutive shifts in different hospitals, junior physicians were given twice the weight value of senior physicians, i.e., 22, while the weight value of senior physicians was 11, so that priority would be given to the satisfaction of junior physicians with the scheduling scenario.
Constrains:
k = 1 K l = 1 L m = 1 M n = 1 N X j k l m n = M j   ,   j
Constraint 9: Number of each physician’s shifts in one week. This formula represents that all outpatient volumes of each physician j in various hospitals within one week must be the same with the scheduling volume.
l = 1 L m = 1 M n = 1 N X j k l m n 2   ,   j , k
Constraint 10: As the regular working hours shall be no more than eight hours per day, each physician can only take at most two shifts per day.
j = 1 J k = 1 K l = 1 L m = 1 M n = 1 N X j k l m n = N w
Constraint 11: Total demand of each department in one week. This formula represents that the total sum of the outpatient volume of all physicians is the same as hospitals’ outpatient volume.
N d 1 j = 1 J l = 1 L m = 1 M n = 1 N X j k l m n N d 2   ,     k
Constraint 12: The number of shifts per day shall be between Nd1 and Nd2 so as to avoid the concentration of shifts on certain days. This formula represents that the daily outpatient volume of each physician must be within the stipulated outpatient volume. Generally, Nd2 cannot be over 2 for a single day, but it is not necessarily scheduled every day, so Nd1 is generally 0.
j = 1 J X j k l m n 1   ,     k , l , m , n
Constraint 13: There can only be one serving physician within each service period.
m = 1 M n = 1 N X j k l m n 1   ,     j , k , l
Constraint 14: Each physician can only serve one shift within each period.
j = 1 J m = 1 M n = 1 N X j k l m n 1   ,     k , l = 1 ~ 2
Constraint 15: In order to avoid the case in which any patient finds no physician in the hospital, outpatient service is required for every period; therefore, on each day, there must be at least one morning shift and one afternoon shift.
j = 1 J m = 1 M n = 1 N X j k l m n 1   ,   f o r   l = 3 , k = 1 ~ 5
Constraint 16: The evening outpatient must be arranged per day in order to serve the patients that work in the daytime; outpatient service is required for every period; therefore, on each day, there must be at least one evening shift except for Saturdays.
j = 1 J m = 1 M n = 1 N X j k l m n = 0 , f o r   k = 6 , l = 3
Constraint 17: No outpatient is arranged on Saturday evenings, so no evening shift can be scheduled for physicians on Saturdays.
Y j k X j k l m n ,     j , k , l , m , n
Constraint 18: If physicians have shifts in any hospital, the day’s schedule must have the schedule records; therefore, the relationship is established between Xjklmn and Yjk.
k = 1 k + 2 Y j k 2   ,     j , k = 1 ~ 4
Constraint 19: To avoid consecutive shifts of physicians, each physician shall not provide services for more than two days consecutively.
j = 1 J k = 1 K m = 1 N m 2 X j k l m n = 0   , f o r   l = 3 , n = 2
Constraint 20: As there is less demand for outpatient services in the branch hospitals, there are no night shifts in the branches.
j = 1 J k = 1 K l = 1 L m = N m 2 + 1 M X j k l m n = 0   , f o r   n = 2
Constraint 21: As there is less demand for outpatient service in the branch hospitals, the branch hospitals only have 1~Nm2 rooms to provide outpatient services, unlike the need for numerous outpatient rooms at the main hospital, so as to avoid the waste of resources.
j = 1 J l = 1 L m = 1 N m 2 X j k l m n = 0   , f o r   k = 6 , n = 2
Constraint 22: The outpatient volume in branch hospitals is small on Saturdays; hence, no shifts can be scheduled in the branch hospitals on Saturdays.
j = 1 J m = 1 N m 2 X j k l m n 1   ,   f o r   k = 1 ~ 5 ,   l = 1 , 2 , n = 2
Constraint 23: Branch hospitals have no evening outpatients; therefore, the branch hospital must have morning and afternoon shifts scheduled every day.
j = 1 J k = 1 K l = 1 L m = N m 3 + 1 M X j k l m n = 0 , f o r   n = 3
Constraint 24: Nursing homes only provide services to the elderly; therefore, they may only have 1~Nm3 rooms to provide outpatient services, unlike the need for numerous outpatient rooms at the main hospital, so as to avoid waste of resources.
j = 1 J k = 1 K l = 2 3 m = 1 N m 3 X j k l m n = 0 , f o r   n = 3
Constraint 25: Nursing homes usually receive fewer visits, so they may not schedule afternoon and evening shifts.
j = 1 J m = 1 N m 3 X j k l m n = 1   ,   f o r   k = 1 , 2 , 4   ,   l = 1 ,   n = 3
Constraint 26: Due to a smaller outpatient volume, nursing homes can schedule morning shifts on Mondays, Tuesdays, and Thursdays.
j = 1 J l = 1 L m = 1 N m 3 X j k l m n = 0   , f o r   k = 3 , 5 , 6   ,   n = 3
Constraint 27: As there is less demand for outpatient services in nursing homes, they may not schedule shifts on Wednesdays, Fridays, and Saturdays.
l = 1 L m = 1 M n = 1 N X j k l m n = 0   ,     j , k D j k
Constraint 28: Physicians tend to be busier on operation days. Hence, to avoid scheduling two tasks in the same period, no outpatient service will be scheduled during surgery periods.
This hospital and the supported branch hospitals are in the same city, with short distances between them. Therefore, the situation of different allowance for traveling to different hospitals does not occur. However, medical inspection is often postponed because of an excessive number of patients. If different hospitals have consecutive outpatients, the starting time of the next outpatient will be postponed due to traffic problems. Therefore, there will not be consecutive outpatients arranged in different hospitals in the scheduling. Constraints (29)–(33) are to prevent physicians from becoming exhausted due to consecutive services in branch hospitals, which may affect their quality of work.
m = 1 M X j k 1 m 1 + X j k 2 m 2 1   ,     j , k
Constraint 29: Physicians taking the morning shift in the main hospital cannot continue to take an afternoon shift in a branch hospital.
m = 1 M X j k 1 m 2 + X j k 2 m 1 1   ,     j , k
Constraint 30: Physicians taking the morning shift in a branch hospital cannot continue to take an afternoon shift in the main hospital.
m = 1 M X j k 1 m 3 + X j k 2 m 1 1   ,     j , k
Constraint 31: Physicians taking the morning shift in a nursing home cannot continue to take the afternoon shift in the main hospital.
m = 1 M X j k 1 m 3 + X j k 2 m 2 1   ,     j , k
Constraint 32: Physicians taking the morning shift in a nursing home cannot continue to take the afternoon shift in a branch hospital.
m = 1 M X j k 2 m 2 + X j k 3 m 1 1   ,     j , k
Constraint 33: Physicians taking the afternoon shift in a branch hospital cannot continue to take the evening shift in the main hospital.
j = 1 N a k = 1 K l = 1 L m = 1 M n = 2 3 X j k l m n = N s 1
Constraint 34: Total number of senior physicians supporting the branch offices and nursing homes.
j = N a + 1 J k = 1 K l = 1 L m = 1 M n = 2 3 X j k l m n = N s 2
Constraint 35: Total number of junior physicians supporting the branch offices and nursing homes.

3.3.2. Calculation of the Income and the Relative Weight of Satisfaction

First, this study calculated the maximum income of the hospital and then used the maximum income as a benchmark for physician scheduling to give a relative weight value of 1, while the relative weight of other income was calculated using the maximum income as the denominator, as shown in Equation (36):
P R W n = P Z n M A X ( P Z 1 , P Z 2 , P Z n )
Next, within the possible range of the maximum income of the hospital, this study calculated the maximum satisfaction of the physicians with scheduling. Similarly, the maximum satisfaction was used as a benchmark to give a relative weight value of 1, while the relative weight of other types of satisfaction was calculated using the maximum satisfaction as the denominator, as shown in Equation (37):
S R W n = S Z n M A X ( S Z 1 , S Z 2 , S Z n )
However, considering that decision makers attach different levels of importance to various scheduling objectives, in order to provide decision makers with more flexible planning, this study took the support income of the hospital as the benchmark and multiplied the relative weight of satisfaction by a decision weight value to show the decision makers’ attention to various scheduling objectives. For example, as shown in Equation (38), the relative weight of satisfaction was multiplied by the sum of the decision weight and the relative weight of income:
DVn = DW * PRWn + (1 − DW) * SRWn
Finally, the maximum decision value could be found through Equation (39) to serve as the basis for management personnel to create schedules:
MDVn = MAX(DV1, DV2, …, DVn)

4. Empirical Analysis

This study took the outpatient service status of physicians in a teaching hospital located in southern Taiwan as the research object. The departments of the empirical hospital include internal medicine, obstetrics and gynecology, pediatrics, dermatology, emergency department, etc. We constructed a 0–1 integer programming model based on the number of physicians in the internal medicine department, the outpatient number, and the demand for outpatient visits of the hospital so as to calculate the sum of the maximum relative weight values of the support income of the hospital and the physician satisfaction with arranging an optimal schedule.

4.1. Data Summary

In this study, physicians were arranged into appropriate shifts based on the actual outpatient visit demand of the empirical hospital. The shift cycle was one week, excluding Sundays. Eight senior physicians and four junior physicians were, respectively, assigned to three hospitals, i.e., the main hospital, a branch hospital, and a nursing home. Table 1 shows the number of outpatient services of the physicians in one week. For the service staffs being assigned to support external hospitals, the main purposes for the hospital to divide the physicians into senior and junior classes according to the 15-year seniority are: (1) Taiwan medical school focuses on the mentorship system in the learning process. External hospitals give more payments to senior physicians to show their respect. (2) As the public praise of senior physicians may bring more patients to branch hospitals, the supported hospitals are willing to spend more money in inviting senior physicians. The main purpose of supporting the branch hospitals is to help bring more patients. For this reason, seniority becomes the determination criteria for the outpatient in the branch hospitals.
Physicians’ surgery tasks need to be performed during a fixed time. As the physicians’ surgery time could be controlled, and considering the physicians’ fatigue after surgery, they would not be assigned to outpatient services on the date of the surgery, as shown in Table 2.

4.2. Results and Description of the Model

In order to achieve the objectives using the optimal scheduling, it was necessary to execute multiple scheduling programs and calculate the relative weight value of each objective, as shown in Table 3, which shows the schedule of 13 outpatient visits in branch hospitals by eight senior physicians and four junior physicians from the internal medicine department of a medical center. The scheduling scenario concerning each type of hospital income represented the sum of the income obtained from different periods of support by physicians of different types to branch hospitals. Two scenarios can be used as an example. Under scenario 1, the charge for each period of support provided by the senior physicians to branch hospitals is NTD 10,000, while the amount is NTD 5000 in the case of junior physicians. If all 13 periods of outpatient service in branch hospitals are supported by senior physicians, the profits of the main hospital (PZ1) will increase to NTD 130,000. Physician satisfaction (SZn) at the right side of Table 3 is the maximum value obtained by the computational formula (1) by setting NS1 of Equation (34) as 13 and NS2 of Equation (35) as 0. After obtaining PZn and SZn, PRWn and SRWn are, respectively, obtained according to Equation (37) and Equation (38). Under scenario 2, 12 periods outpatient services in branch hospitals are supported by senior physicians, and one is supported by junior physicians, which will give the main hospital an income of NTD 125,000, and so on. Based on the 13 periods of outpatient services in branch hospitals that require physician support, 14 scheduling scenarios could be made according to the different periods of support by physicians of different seniority.
It takes about 8 h to rearrange the schedule of the internal department by manual scheduling. As shown in Table 3, compared with manual scheduling, the operation by computer using the mathematical model was more efficient, as it was able to find the optimal schedule for both the maximum profit of the hospital and physician satisfaction in one minute and 41 s. Next, the relative weight value of each objective was filled into a Microsoft Excel document in order to calculate different decision-weight values. According to Equation (38), DVn = DW * PRWn + (1 − DW) * SRWn, managers could adjust the decision weight (DW) according to the practical needs and calculate the decision value of different weights under various scenarios, as shown in Table 4. With senior 2 as the example, when DW = 0.7, DV = 0.7 * 0.962 + (1 − 0.7) * 0.749 = 0.898, decision makers could then choose the scheduling scenario according to the importance attached to the operating income generated by the provision of support and the physician satisfaction so as to achieve a balance between the two. Taking decision makers’ selection of DW = 0.5 as an example, it indicates that they pay equal attention to finance and satisfaction. According to the field of DW = 0.5 in Table 5, the decision value under various situations may be obtained, and the data are recorded in Figure 1. As shown in Figure 1, scenario 3 has the best decision value (0.863), which means that when decision makers select equal attention to finance and satisfaction (DW = 0.5), the best decision is to assign 11 senior physicians and 2 junior physicians (scenario 3) to branch hospitals for medical inspection. Table 5 is the duty schedule for physicians in the internal medicine department made according to the calculation result of scenario 3. It could be seen from Table 5 that there were no schedules with shifts on three consecutive days, no night shifts in the branch hospital, only morning shifts in the nursing home, and no consecutive shifts in different hospitals. Therefore, the scheduling system developed in this paper could not only calculate the results quickly but could also meet the constraints of the schedule and enable managers to adjust the weight between finances and satisfaction according to the actual needs so as to meet the requirements of hospital management.

4.3. Sensitivity Analysis

According to Table 5, the duty quantity of senior and junior physicians in branch hospitals is 11 and 2 times, respectively. Therefore, the weekly support cost PZ3 = charge of senior physicians•11 + charge of junior physicians•2. If the charge of senior physicians each time remains at 10,000 and that of junior physicians is adjusted from −15% to 15%, the variation in the weekly total expenses is shown in Table 6.
If the charge of junior physicians remains unchanged at 5000 but that of senior physicians is adjusted from −15% to 15%; the variation in the weekly total expense is shown in Table 7.
According to Table 6 and Table 7, when the charge of junior physicians is increased to 15%, the total charges only increase by 1.25%; however, when the charge of senior physicians is increased to 15%, the total charges increase by 13.75%. Therefore, it is suggested that under the same satisfaction situation, the expatriate charges of senior physicians may be increased, which will help with the total income of the hospital. However, the burden of the supported hospital should also be considered. If the support cost of junior physicians is increased, hospitals should also increase payments of junior physicians. This will not put much burden onto the supported hospitals; meanwhile, it can increase the junior physicians’ willingness in working in the branch hospitals and their work efficiency.

5. Conclusions

In order to expand the business, hospitals tend to assign physicians to other hospitals to help with medical inspections. Besides increasing the line-up of physicians of the supported hospitals, the public praise of physicians from the main hospital will attract more peripheral patients and improve the competitiveness of hospitals. However, expatriate involves physicians’ willingness to work and financial income. This research regarded the income obtained by different expatriates as a weight and takes the number of expatriates as the basis to calculate the score of the best satisfaction as another weight. When decision makers determine the two’s weight ratio according to the actual condition of hospitals, this research may rapidly provide the schedule with the best financial income and the highest satisfaction. This research took a certain hospital in Taiwan and its cooperative hospitals and nursing home as examples. Focusing on decision makers, this system allowed decision makers to determine the weight of finance and satisfaction primarily according to the actual conditions of hospitals. The time spent by administration personnel in making the schedule of physicians is reduced from 8 h to 101 s, thus greatly reducing the burden of administration personnel. In addition, the sensitivity analysis was conducted according to the schedule situation. The analysis results suggested that increasing the expatriate charges of senior physicians may help with the total income. However, this might lead to relatively low willingness in cooperation of the supported hospitals. If the expatriate charge of junior physicians is increased, it may lower the burden of the supported hospitals and increase their willineness in cooperation. This may also enhance the junior physicians’ willingness to work in branch hospitals and their work efficiency.

Author Contributions

Conceptualization, Y.-C.H.; formal analysis, Y.-C.L.; methodology, Y.-C.H.; project administration, Y.-C.H.; software, J.-C.H.; writing—original draft, J.-C.H. and Y.-C.L.; writing—review and editing, Y.-C.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by the Ministry of Science and Technology, Taiwan. (MOST 105-2221-E-020 -030-).

Institutional Review Board Statement

The study was approved by Antai-Tian-Sheng memorial Hospital Institutional Review Board (TSMH IRB No.: 21-025-B).

Informed Consent Statement

Informed consent was obtained from all subjects involved in the study.

Data Availability Statement

Our data were made available with the submission.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Laporte, G.; Nobert, Y. Location Decisions An exact algorithm for minimizing routing and operating costs in depot location. Eur. J. Oper. Res. 1981, 6, 224–226. [Google Scholar] [CrossRef]
  2. Zhang, L.; Xia, X. An integer programming approach for truck-shovel dispatching problem in open-pit mines. Energy Procedia 2015, 75, 1779–1784. [Google Scholar] [CrossRef] [Green Version]
  3. Tsiakis, P.; Papageorgiou, L.G. Optimal production allocation and distribution supply chain networks. Int. J. Prod. Econ. 2008, 111, 468–483. [Google Scholar] [CrossRef]
  4. Manzini, R.; Gamberi, M.; Regatierri, A. Applying mixed integer programming to the design of a distribution logistic network. Int. J. Ind. Eng. Theory Appl. Pract. 2006, 13, 207–218. [Google Scholar]
  5. Bard, J.F.; Binici, C. Staff scheduling at the United States Postal Service. Comput. Oper. Res. 2003, 30, 745–771. [Google Scholar] [CrossRef]
  6. Franz, L.S.; Baker, H.M.; Leong, G.K.; Rakes, T.R. A mathematical model for scheduling and staffing multiclinic health regions. Eur. J. Oper. Res. 1989, 41, 277–289. [Google Scholar] [CrossRef]
  7. Abara, J. Applying integer linear programming to the fleet assignment problem. Interfaces 1989, 19, 20–28. [Google Scholar] [CrossRef]
  8. Desaulniers, G.; Desrosiers, J.; Dumas, Y.; Marc, S.; Rioux, B.; Solomon, M.M.; Soumis, F. Crew pairing at Air France. Eur. J. Oper. Res. 1997, 97, 245–259. [Google Scholar] [CrossRef]
  9. Azaiez, M.N.; Al Sharif, S.S. A 0-1 goal programming model for nurse scheduling. Comput. Oper. Res. 2005, 32, 491–507. [Google Scholar] [CrossRef]
  10. Jin, H.; Thomas, B.W.; Hewit, M. Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning. Comput. Ind. Eng. 2016, 97, 202–211. [Google Scholar] [CrossRef] [Green Version]
  11. Ebrahimi, M.; Ghomi, S.M.T.F.; Behrooz Karimi, B. Application of the preventive maintenance scheduling to increase the equipment reliability: Case study- bag filters in cement factory. J. Ind. Manag. Optim. 2020, 16, 189. [Google Scholar] [CrossRef] [Green Version]
  12. Meisels, A.; Schaerf, A. Modelling and solving employee timetabling problems. Ann. Math. Artif. Intell. 2003, 39, 41–59. [Google Scholar] [CrossRef]
  13. Sanjoy, K.P.; Abdullahil, A. Minimization of work-in-process inventory in hybrid flow shop scheduling using fuzzy logic. Int. J. Ind. Eng. Theory Appl. Pract. 2010, 17, 115–127. [Google Scholar]
  14. Huang, Y.C.; Lin, H.C.; Huang, Y.W. Application of the autocorrelation function to working-day calculation in power management. Appl. Soft Comput. 2017, 68, 923–931. [Google Scholar] [CrossRef]
  15. Morris, J.G.; Showalter, M.J. Simple approaches to shift, days-off and tour scheduling problems. Manag. Sci. 1983, 29, 942–950. [Google Scholar] [CrossRef]
  16. Meriem, T.; Sabrina, B.H.; Fatima, B.S.; Belaid, B. A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints. Appl. Soft Comput. 2017, 59, 556–573. [Google Scholar]
  17. Yan, S.; Tang, C.H.; Lee, M.C. A flight scheduling model for Taiwan airlines under market competitions. Omega 2007, 35, 61–74. [Google Scholar] [CrossRef]
  18. Kenan, N.; Jebali, A.; Diabat, A. An integrate d flight scheduling and fleet assignment problem under uncertainty. Comput. Oper. Res. 2018, 100, 333–342. [Google Scholar] [CrossRef]
  19. Valouxis, C.; Housos, E. Combined bus and driver scheduling. Comput. Oper. Res. 2002, 29, 243–259. [Google Scholar] [CrossRef]
  20. Kang, L.; Chen, S.; Meng, Q. Bus and driver scheduling with mealtime windows for a single public bus route. Transp. Res. Part C Emerg. Technol. 2019, 101, 145–160. [Google Scholar] [CrossRef]
  21. Lau, H.C. On the Complexity of Manpower Shift Scheduling. Comput. Oper. Res. 1996, 23, 93–102. [Google Scholar]
  22. Kecklund, G.; Eriksen, C.A.; Åkerstedt, T. Police officers attitude to different shift systems: Association with age, present shift schedule, health and sleep/wake complaints. Appl. Ergon. 2008, 39, 565–571. [Google Scholar] [CrossRef]
  23. Carter, M.W.; Lapierre, S.D. Scheduling emergency room physicians. Health Care Manag. Sci. 2001, 4, 347–360. [Google Scholar] [CrossRef]
  24. Damcı-Kurt, P.; Zhang, M.; Marentay, B.; Govind, N. Improving physician schedules by leveraging equalization: Cases from hospitals in U.S. Omega 2019, 85, 182–193. [Google Scholar] [CrossRef] [Green Version]
  25. Bruni, R.; Detti, P. A flexible discrete optimization approach to the physician scheduling problem. Oper. Res. Health Care 2014, 3, 191–199. [Google Scholar] [CrossRef]
  26. Latorre-Núñez, G.; Lüer-Villagra, A.; Marianov, V.; Obreque, C.; Ramis, F.; Neriz, L. Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries. Comput. Ind. Eng. 2016, 97, 248–257. [Google Scholar] [CrossRef]
  27. Beaulieu, H.; Ferland, J.A.; Gendron, B.; Michelon, P. A mathematical programming approach for scheduling physicians in the emergency room. Health Care Manag. Sci. 2000, 3, 193–200. [Google Scholar] [CrossRef] [PubMed]
  28. Brucker, P.; Qu, R.; Burke, E. Personnel scheduling: Models and complexity. Eur. J. Oper. Res. 2011, 210, 467–473. [Google Scholar] [CrossRef] [Green Version]
  29. Tharmmaphornphilas, W.; Norman, B.A. A quantitative method for determining proper job rotation intervals. Ann. Oper. Res. 2004, 128, 251–266. [Google Scholar] [CrossRef]
  30. Schoenfelder, J.; Bretthauer, K.M.; Wright, P.D.; Coe, E. Nurse scheduling with quick-response methods: Improving hospital performance, nurse workload, and patient experience. Eur. J. Oper. Res. 2020, 283, 390–403. [Google Scholar] [CrossRef]
  31. Ferrand, Y.; Magazine, M.; Rao, U.S.; Glass, T.F. Building cyclic schedules for emergency department physicians. Interfaces 2011, 41, 521–533. [Google Scholar] [CrossRef] [Green Version]
  32. Puente, J.; Gómez, A.; Fernández, I.; Priore, P. Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms. Comput. Ind. Eng. 2009, 56, 1232–1242. [Google Scholar] [CrossRef]
  33. Tsai, C.-C.; Li, S.H.A. A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Syst. Appl. 2009, 36, 9506–9512. [Google Scholar] [CrossRef]
  34. Topaloglu, S.; Selim, H. Nurse scheduling using fuzzy modeling approach. Fuzzy Sets Syst. 2010, 161, 1543–1563. [Google Scholar] [CrossRef]
Figure 1. Decision value for each scenario when DW = 0.5.
Figure 1. Decision value for each scenario when DW = 0.5.
Healthcare 09 01004 g001
Table 1. Number of outpatient physicians.
Table 1. Number of outpatient physicians.
DepartmentInternal Medicine Department
SenioritySP SPSPSPSPSPSPSPJPJPJPJP
Code of physicianA1A2A3A4A5A6A7A8A9A10A11A12
Shift number of physician555444444333
Total shift number of department48
Note: SP, senior physicians; JP, junior physicians.
Table 2. Physicians’ surgery schedule.
Table 2. Physicians’ surgery schedule.
WeekMONTUEWEDTHUFRISAT
Department
Internal medicine departmentA1, A12A2, A4, A11A5,A8 A7, A10
Table 3. Relative weight of each scheduling objective.
Table 3. Relative weight of each scheduling objective.
ScenarionSupport Income of the HospitalPhysician SatificationComputer
Time
Ns1Ns2Profit
(PZn)
Relative Weight (PRWn)Satification
(SZn)
Relative Weight (SRWn)
1130130,00015920.5927 s
2121125,0000.9627490.7495 s
3112120,0000.9238020.8025 s
4103115,0000.8857980.7989 s
594110,0000.8468760.8766 s
685105,0000.8088220.82211 s
776100,0000.7699100.9119 s
86795,0000.7317560.7569 s
95890,0000.6927130.7135 s
104985,0000.6547200.725 s
1131080,0000.615100015 s
1221175,0000.5777760.7765 s
1311270,0000.5389540.9545 s
1401365,0000.57000.75 s
Total operation time101 s
Table 4. Decision values (DV) of scheduling scenarios.
Table 4. Decision values (DV) of scheduling scenarios.
ScenarioPRWnSRWnDW (Decision Weight)
10.90.80.70.60.50.40.30.20.10
110.59210.9590.9180.8780.8370.7960.7550.7140.6740.6330.592
20.9620.7490.9620.9410.9190.8980.8770.8560.8340.8130.7920.7700.749
30.9230.8020.9230.9110.8990.8870.8750.8630.8500.8380.8260.8140.802
40.8850.7980.8850.8760.8680.8590.8500.8420.8330.8240.8150.8070.798
50.8460.8760.8460.8490.8520.8550.8580.8610.8640.8670.8700.8730.876
60.8080.8220.8080.8090.8110.8120.8140.8150.8160.8180.8190.8210.822
70.7690.910.7690.7830.7970.8110.8250.8400.8540.8680.8820.8960.91
80.7310.7560.7310.7340.7360.7390.7410.7440.7460.7490.7510.7540.756
90.6920.7130.6920.6940.6960.6980.7000.7030.7050.7070.7090.7110.713
100.6540.720.6540.6610.6670.6740.6800.6870.6940.7000.7070.7130.72
110.61510.6150.6540.6920.7310.7690.8080.8460.8850.9230.9621
120.5770.7760.5770.5970.6170.6370.6570.6770.6960.7160.7360.7560.776
130.5380.9540.5380.5800.6210.6630.7040.7460.7880.8290.8710.9120.954
140.50.70.50.5200.5400.5600.5800.6000.6200.6400.6600.6800.7
Table 5. Physicians’ duty schedule.
Table 5. Physicians’ duty schedule.
MondayTuesdayWednesday
Main HospitalBranch hospitalNursing homeMain HospitalBranch hospitalNursing homeMain HospitalBranch hospitalNursing home
OP service 1OP service 2OP service 3SurgeryOP service 1OP service 2OP service 3SurgeryOP service 1OP service 2OP service 3Surgery
MSA8A7 A1
A12
A3A4A5A10A1A2
A4
A11
A3A9A4A2A7A5
A8
A6
AS A9 A8 A3 A4A12A1A6
ESA3A10A11 A1 A1A2
ThursdayFridaySaturday
Main hospitalBranch hospitalNursing homeMain hospitalBranch hospitalNursing homeMain hospitalBranch hospitalNursing home
OP service 1OP service 2OP service 3SurgeryOP service 1OP service 2OP service 3SurgeryOP service 1OP service 2OP service 3Surgery
MS A12 A5A7A8 A5A7
A10
A2 A7A3A2
ASA10 A6 A5A4A9A2 A11A6A1
ESA12 A11A8A9
Note: MS, morning shift; AS, afternoon shift; ES, evening shift.
Table 6. Relational table between charge changes of junior physicians and total charges.
Table 6. Relational table between charge changes of junior physicians and total charges.
Change % for JP−15%−10%−5%0%5%10%15%
Charge for JP4250450047505000525055005750
PZ3118,500119,000119,500120,000120,500121,000121,500
ΔPZ3−1.25%−0.83%−0.42%0%0.42%0.83%1.25%
Table 7. Relational table between charge changes of senior physicians and total charges.
Table 7. Relational table between charge changes of senior physicians and total charges.
Change % for SP−15%−10%−5%0%5%10%15%
Charge for SP85009000950010,00010,50011,00011,500
PZ3103,500109,000114,500120,000125,500131,000136,500
ΔPZ3−13.75%−9.17%−4.58%0%4.58%9.17%13.75%
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Huang, Y.-C.; Hwang, J.-C.; Lin, Y.-C. The Optimization between Physician Satisfaction and Hospital Profit in Cross-Hospital Scheduling—A Case Study of Some Hospitals in Taiwan. Healthcare 2021, 9, 1004. https://doi.org/10.3390/healthcare9081004

AMA Style

Huang Y-C, Hwang J-C, Lin Y-C. The Optimization between Physician Satisfaction and Hospital Profit in Cross-Hospital Scheduling—A Case Study of Some Hospitals in Taiwan. Healthcare. 2021; 9(8):1004. https://doi.org/10.3390/healthcare9081004

Chicago/Turabian Style

Huang, Yi-Chao, Jong-Ching Hwang, and Yi-Chun Lin. 2021. "The Optimization between Physician Satisfaction and Hospital Profit in Cross-Hospital Scheduling—A Case Study of Some Hospitals in Taiwan" Healthcare 9, no. 8: 1004. https://doi.org/10.3390/healthcare9081004

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop