Professional Documents
Culture Documents
2. Title of Research: (In English): Goal Programming Model and Its application in
Resource Allocation in Industry
Title of Research (In Hindi): लक्ष्य प्रोग्रामिंग मॉडल और उद्योग में संसाधन
आवंटन में इसका अनुप्रयोग
3. Location:
4. Introduction:
Basics of Goal Programming: Goal Programming (GP) is one of highly efficient techniques
for multiple objective decision analysis. It is a very a powerful tool, which is inspired by the
well-established and noted technique of Linear Programming. It additionally offers good
solutions to a sophisticated method of implementing objectives. GP can effectively manage
the decision problem with single goal and multiple sub goals. Occasionally, goals tend to
contain no common measures. Establishing a hierarchy of importance among such conflicting
goals become a very important to meet the goals at lower order. In certain cases, they reach to
level where no additional enhancements can be made. The problems can be easily resolved
through GP; it is also follows that all relationships of the model should be linear.
The major benefit of GP is that; it does not emphasize on maximizing or minimizing the
objective criterion straightforwardly. Instead, it tries to minimize the offset in the objectives
and certain achievements which can made under a given set of constraints. The offset
variables can be denoting in two dimensions, namely, positive and negative deviations/offset
from every sub goal or goal. Later on, the objective function can assist in minimizing such
deviations on the basis of priority assigned to them, or their relative importance.
1
There is certain possibility that the decision maker is not able to gain access to few details, on
the value of cost of a specific objective or part of it. Nevertheless, the decision maker can
assess its upper or lower limits. In general, the decision maker can always decide on the
priority of the required objective or sub-goal. The priorities can be assigned accordingly.
However, it is not very simple to achieve the objective up to a desired level. Hence,
irrespective of Goal Programming, the decision maker can assign particular priority to
accomplish a specific objective. Hence, it can be ascertained the actual objective of Goal
Programming is its achievements towards the determination of solution for various decision
problems, which generally contains numerous contending goals and complicated priority
structure.
General Goal Programming Model: GP is a sophisticated and robust tool with flexible
mechanism, which can be implemented on various decision problems which are related to
multiple objectives. Nevertheless, it must be noted that the GP is not a comprehensive
solution for all decision problems. GP can be implemented only under certain conditions. So
far, majority of the GP applications were restricted to well-defined deterministic problems.
Additionally, the primary analysis is restricted to determine a possible solution to optimize
the achievement of the objective without violating any specified criteria.
m
Optimize Z= ∑ P k ¿ ¿ (1)
i=1
Or
m
Optimize Z= ∑ P k ¿ ¿ (2)
i=1
m
Subject to Z= ∑ aij x j+ ¿ ¿ (3)
i , j=1
+¿ ≥0 ¿
And x i ,d −¿,
i
d i ¿
(4)
−¿ ¿ +¿ ¿
Where Pk are pre-emptive priorities, d i are negative deviational variables,d i are positive
deviational variables, which always determines the attainment below and above goal. If
−¿¿ +¿¿
necessary, we can combine pre-emptive priorities with relative weighting. w i and w i are
−¿ ¿ +¿ ¿
weight attached to deviational variables d i and d i , a ij are technological coefficients, xj are
2
decision variables, bi are right-hand side goal values. The p k where k =1, 2,…..K pre-emptive
priorities are ranking for the goals constraints such that the ranked importance of 𝑝1> 𝑝2> 𝑝3>
> > > > > 𝑝𝑘. The general objective of GP is to reduce the offset between the achieved goals
and targeted goals. Various methods can be used to accomplish this task, which forms
different variants of GP. The formulation of GP is a long process. It first begins by
establishing a set of parameters which must be included for analysis of problem. After the
parameters are established, the target value is estimated, which illustrates the required success
level for each parameter. In short, the formulation of a GP involves setting up of objectives as
a collaboration of each parameter with its consequent target.
Goal programming is similar to the linear programming problem (L.P,P) the basis difference
is the details of objective function is entered in desired ordered. Another methodology to goal
programming is to state the goals as constraints in addition to the normal constraints of the
problem. The objective function is always minimizing deviations. The deviation are
represented by weight, and then the problem can be solved by L.P.P . Sensitivity analysis can
also be done for goal programming. The goal programming is one of the mathematical tools,
designed in perspective of solving the multi-objective problems in diverse areas for taking the
efficient, timely and accurate decision. Many researchers are investigating continuously and
3
exploring the uses of goal programming tools in resource allocation. There are different kinds
of goal programming models namely:
Resource Allocation through Goal Programming: Public pressure and limited quantities of
resources necessitate development of more reliable decision making techniques. Modern
resource managers are rapidly becoming aware of new decision aiding techniques which are
capable of reviewing, utilizing, and organizing vast quantities of resource data.
Many models utilizing operation research techniques have been developed to aid range and
other resource managers. The most common technique used has been linear programming for
the resource allocation used from years by several researchers [1-4].
Decision makers realize, however, that linear programming models are single objective or
single goal systems; the objective has commonly been profit maximization or cost
minimization. Organizations seldom have a single goal; in fact, in public land management,
the classical economic objective of maximum net revenue often rates only a low priority.
Linear programming has been modified in order to allocate resources when multiple
[5]
conflicting goals are present . The procedure is called goal programming. The traditional
method of solving multiple goal problems has been to define all goals in a common unit
(usually dollars). Managers and most economists have been highly critical of this procedure
as all goals cannot be translated into strictly economic terms. In goal programming, there is
no requirement that the objectives be defined in the same value, terms. In fact, multiple goals
may be in terms of board feet of timber, number of cattle, or dollars, as well as number of
sales and regional incomes. The only requirement in goal programming is that the manager
can attach ordinal priorities or rankings to the goals that reflect the importance of each goal.
Once goals have been defined and ranked according to importance, a solution via goal
4
programming can be obtained. The decision maker can then change the goal priorities, and by
examining the solutions, he can obtain an estimate of the tradeoffs between goals.
• Determine the degree of attainment of the goals with the resources available.
• Determine the resources required to achieve a desired set of objective.
• Provide the best satisfying solution under varying priorities of goals and amount of
resources satisficing in the GP models.
To get the deeper insight about the application and significance of the Goal programming in
resource allocation, this research work is conceptualized to study the basic principles and
definition of goal programming used for resource allocation followed with the solution
methodology. Further, the research work will discuss the Fuzzy logic based program for
planning the resource allocation in manufacturing plants followed with mathematical
implementation. Hence, the overall objectivity of the research work revolves around the
proposing the advanced goal programming models in order to solve production planning
problems in industry.
The Industrial world faced a depression after Second World War in solving a variety of
industrial problems. Industrialist after solving problems using various models determined
Operations Research (OR) technique can be used conveniently in solving such problems.
Then onwards, industrial problems are solved using various models of Operations Research
or Goal Programming (OR/GP). These models are used to increase the productivity,
minimize the cost of production, and use carefully the available resources and for healthy
growth of industries.
5
Hence, the principal objectivity behind the research is driven through the need of identifying
the method of administering in resources in specific sector (manufacturing) has become
dynamic and demanding in modern manufacturing system. In different production industries
or the manufacturing companies, there is a lot of space for the manufacturing process. This is
due to the need for finished goods in different segments is increasing with the population
growth. Furthermore, one of the causes of manufacturing cost increases is the rapid rise in the
price of raw material, technology change, increase in wages, maintenance cost etc. In
addition, the difficulty of procedures has rendered the available facilities ineffective. As a
result, administration is a difficult task for management to solve.
In goal programming, goals are considered as constraints along with the normal constraints of
the problem with the minimization of goal deviation as objective given weights to assign
priorities to the various goals. Such problem is then solved using the linear programming
model; hence sensitivity analysis is also feasible. For more than five decades, researchers are
continuously exploring this field where goal programming is termed as one of the
mathematical tool, designed to solve multi-objective problems in different areas for taking
the efficient, timely and accurate decision. Further, Meta-goal programming approach will
also be used as it is more flexible than the usual GP models and allows decision-makers to
establish target values not only for the goals but also for another criterion functions through
allowing to the decision makers to establish target values not only for the goals but also for
another criterion functions assuming fuzziness. A specific determination of the Fuzzy Goal
Programming (FGP) technique to solve the transportation problem in industry will also be
incorporate in the study to explore the Linear Programming (LP) problems with sources and
destinations with the objective function coefficient representing cost of transportation, time of
delivery, number of goods transported, unfulfilled demand, and many others. Several
quantitative techniques in Operations Research (OR) exists for solving transportation
problems involving goals that are multiple and conflicting such as the minimization of cost,
transportation fleets, etc. using Goal Programming (GP) technique.
6. Scope of the Proposed Study: In the light of two biggest problems with goal
programming are to attribute, the decision maker gives satisficing target value which is an
[8]
empirical requirement and lack of theoretical foundation in determining the achievement
functions form for a goal programming model. To overcome issues associated with goal
programming problems in context to solve the production planning problems in industry the
study mainly emphasizes over:
6
1. Application of the Fuzzy Meta-Goal programming in Production planning in
manufacturing followed with the integration of interactive fuzzy meta-goal
programming in similar context.
2. Capacitated industrial problem solution through application of Fuzzy chance
constrained fuzzy goal programming model.
3. Determination of EPQ through the application of weighted fuzzy goal programming
for solving fuzzy multi-objective linear fractional inventory model.
Hence, the major scope of the proposed research work revolves around planning of
production using goal programming, Fuzzy Meta-Goal Programming (to decide the number
of units to be produced), interactive Fuzzy Meta-Goal Programming followed with the
recommendation of solutions for approximation scheme for deteriorating items. In order to
maximize the profit, the research will also present the fuzzy multi-objective linear fractional
inventory to determine the EPQ. For assessing the optimization of the results LINDO
optimizer solver software will be used.
7
[26]
Valley of Assam in order to flourish the tea industries. Sen and Nandi applied a goal
[27]
programming approach to rubber plantation planning in Tripura. Sen and Nandi
formulated a goal programming model for rubber wood door manufacturing factory in
[28]
Tripura. Sen and Nandi reviewed goal programming and its application in plantation
[29]
management. Baran et al. formulated a goal programming model by using genetic
algorithm to solve economic environmental electric power generation problem with interval-
valued target goals.
[30]
Anggraeni et al. proposed goal programming method having multiple objectives, namely,
maximizing machine usage, maximizing revenue and minimizing production costs to
[31]
determine a combination of number of products. Schniederjans et al. presented a goal
programming model in order to support planning decisions in the value analysis using critical
path method and concurrent engineering.
[32]
Yu et al. proposed two weighted goal-programming models for optimizing crude oil
production with the problem being divided into two stages. First stage involved optimization
of total planned crude oil yield by four sub-yields and the later stage involved optimal
allocation of each sub-yield among different oil extract plants. Providing crisp definition of
goal priorities, in practice, is not an easy task, where multi-objective decision problems are
considered. Uncertainty may be inherent in relative importance relations among the goals, or
alternatively the perception of the relative importance relations among the goals may be
vague from the decision maker’s point of view. The decision space and correlation between
objectives may also have effects on the definition of importance relations among the goals.
Hence, there is a need to develop a FGP model which takes into account these uncertainties
and provides a flexible decision making tool.
[33]
Iskander M. G. proposed an exponential membership functions in Fuzzy Goal
Programming utilized within two main forms of fuzzy goal program. It showcased the
comparison between the lexicographical minimization model and the model with a
preemptive goal hierarchy applied to a fuzzy textile production planning problem, where the
membership functions of the fuzzy goals are considered exponential with either increasing or
decreasing rate of change. It can be concluded that, if the decision-maker is not sure about the
tolerance limits of the fuzzy data, it is preferable to use the lexicographical minimization
model, in order to minimize the sensitivity of the change in results due to the change in data.
Also, the lexicographical minimization model is recommended, when the desirable
8
achievement levels for the goals having top priority level are extremely limited, so as to avoid
having infeasible solution when the model with a preemptive goal hierarchy is used. This
conclusion is applicable whether in the case of increasing or the case of decreasing rate of
change. On the other hand, if the decision-maker is seeking to get different set of results
based on different tolerance limits that reflect alternative production scenarios, then the
model with a preemptive goal hierarchy can be preferable. Finally, whether in the case of
increasing or the case of decreasing rate of change, if an optimal solution exists for each of
the two models, the trade-off between not getting zero for any membership function and
achieving large values for the membership functions with high priority levels is a main
criterion for choosing between the two models.
[34]
Ighravwe et al. formulated a bi-objective programming based facility layout design
problem having the objectives to minimize workforce costs and maximize efficiency
improvement in a layout. In this procedure, fuzzy goal programming and big-bang big-crunch
algorithm is used in order to generate a Pareto solution. The proposed model was tested using
a small-scale sachet water production enterprise data.
Hocaoğlu[35] addressed the issue of allocating the air defense missiles to incoming air targets
to maximize the air defense effectiveness of land-based air defense systems. A constraint
based nonlinear goal programming (multi-objective) model for weapon assignment problem
to minimize survival probability was developed. A simulation model as an optimizer agent
was developed and located in air defense simulation scenarios. The model collects input data,
optimize assignments, calculates fire times, and schedules fire orders.
[36]
Nesticò et al. defined a multi-criteria evaluation model capable of selecting the
combination of the best combination of the projects that must make up an integrated urban
regeneration program. The novelty of the research was the combination of the algorithms of
the Analytical Network Process (ANP) with those of the Zero-One Goal Programming
(ZOGP), where the ANP makes it possible to clarify the interdependence relations between
the criteria, as well as between criteria and projects, while the ZOGP allows considering
requirements and constraints of the reference system. The results of the research showed that
the model is able to direct the decision-maker towards urban regeneration programs that,
effectively, reach the maximization of the final benefits, both in financial and socio-
environmental terms. The algorithms also revealed the considerable flexibility of the
9
instrument, so much that it can be easily applied also for the characterization of urban
programs aimed at different territorial contexts.
[37]
Keynezhad and Goharshenasan analyzed the problems of project portfolio selection and
project scheduling simultaneously based on the resource constraints and specific modelling
parameters. A model was presented based on linear programming that had the capacity of
expressing different possible situations in this problem. Small problems were solved by the
Epsilon constraint method in GAMS whose results are accurate in small scale, and then two
platform-independent meta-algorithms were used to check the quality of the proposed
answers. The quality of the solutions in the two objective functions and the low-level solving
time of NSGA-II algorithm were compared with the MOPSO algorithm which had better
performance than NSGS-II algorithm. It was also mentioned that the C-index, the NSGA-II
method provided better answers than the MOPSO method. In the dispersion index, the
uniform Pareto border was obtained based on the results of the MOPSO method.
[38]
Zhang et al. proposed a resource allocation algorithm based on deep reinforcement
learning (DRL) to solve the problem of co-existing enhanced mobile broadband (eMBB)
slices and ultra-reliable low latency communication (URLLC) slices based on Non-
Orthogonal Multiple Access (NOMA) in downlink network scenarios. Double Deep Q
network (DDQN) is designed to output subcarrier and power allocation simultaneously.
Simulation results showed that compared with the baseline based on heuristic joint user
pairing and power allocation algorithm and Orthogonal Multiple Access (OMA), proposed
algorithm can achieve higher spectral efficiency and ensure isolation between slices.
Following research gaps were identified under the subject area from research works
performed over the goal programming and its applications in resource allocation particularly:
10
4. Assessment of the optimization of results through optimization software namely
LINDO.
Hence, major research gaps identified in context to planning of production through different
Goal Programming (Fuzzy Meta-Goal Programming, Interactive Fuzzy Meta-Goal
Programming) followed with the maximization of the profit through linear fractional
inventory to determine the Economic Production Quantity. For assessing the optimization of
the results LINDO optimizer solver software will be used.
Following are the potential research objectives of the proposed research work:
In particular, the research will express the resource allocation optimization through goal
programming, Fuzzy Meta-Goal Programming, interactive Fuzzy Meta-Goal Programming
followed with the modelling of an approximation scheme for optimal production run time and
duration of the shortages by minimizing the total system cost. For the maximization of profit,
the research will also present the fuzzy multi-objective linear fractional inventory to
determine the EPQ. LINDO optimizer solver software will be used to measure the
effectiveness of the results on the basis of different parameters and values.
11
maker to incorporate organizational, environmental and managerial consideration into model.
Goal programming can involve linear, integer, zero-one, or nonlinear multi-objective
problem, for which preemptive priorities can be established. The objectives of the research
work would be attained by following the methodological execution of the Goal Programming
for different aspects, which is as follows:
Methodology and Research Plan followed for Fuzzy Meta-Goal Programming (FMGP)
and Interactive Fuzzy Meta-Goal Programming (IFMGP) for production planning:
Methodology and Research Plan for effectiveness of Fuzzy Chance Constrained Fuzzy
Goal Programming technique in transportation:
12
Methodology and Research Plan for approximation scheme for optimal production run
time and duration of the shortages by minimizing the total system cost:
Chapter 1: Introduction to Goal Programming: This chapter will present the introduction
of Goal Programming incorporating some definitions relating the goal programming and its
application. Subsequent section of the chapter will present the different types of goal
programming model with solution methodology.
Chapter 2: Review of Literature: This chapter will incorporate some specific studies
related with the study topic and allied topics in form of summaries.
13
Chapter 5: About Production Inventory Modelling: This chapter will present single item
production inventory model. Subsequent section will present the model developed for finite
time horizon. A solution procedure for an approximation scheme will be discussed. A
numerical example will be carried out for the illustration of the model.
Chapter 7: Conclusion, Major Findings and Recommendations: This chapter will present
the conclusion, major findings and recommendations for the future research work.
13. Bibliography:
[1] D'Aquino, S. A. (1974). A Case Study for Optimal Allocation of Range Resources.
Journal of Range Management, 27(3), 228–233. https://doi.org/10.2307/3897040
[2] Bartlett, E. T., Evans, G. R., & Bement, R. E. (1974). A serial optimization model for
ranch management. Journal of Range Management, 27(3), 233–239. http://doi.org/10.2307/
389704
[3] Nielsen, D. B., William, G. B., Dillard, H. G., & Thomas, R. B. (1966). Economics of
federal range use and improvement for livestock production. Oregon Agricultural Experiment
Station, Technical Bulletin, 92, 40D
[4] McConnen, R. J., Navon, D. L., & Amidon, E. L. (1965). Efficient development and use
of forest lands: An outline of a prototype computer-oriented system for operation planning. In
Mathematical models in forest management, Forestry Commission, 59 (pp. 18–32).
[5] Johnsen, E., Charnes, A., & Cooper, W. W. (1961). Management models and industrial
applications of linear programming: I and II. John Wiley & Sons, Inc.
[6] Ignizio, J. P. (1987). A Reply to "Comments on an Algorithm for Solving the Linear Goal
Programming Problem by Solving its Dual". Journal of the Operational Research Society,
38(12), 1149–1154. https://doi.org/10.1057/jors.1987.196
[7] Romero, C. (2004). A general structure of achievement function for a goal programming
model. European Journal of Operational Research, 153(3), 675–686. https://doi.org/10.1016
/S0377-2217(02)00793-2
14
[8] Gonzalez-Pachon, J., & Romero, C. (2004). Satisficing logic and goal programming:
Towards an axiomatic link. Information systems and operations research. Informatics
Review, 42, 157–161. https://doi.org/10.1080/03155986.2004.11732699
[9] Charnes, A., & Cooper, W. W. (1977). Goal programming and multiple objective
optimization (Part I). European Journal of Operational Research, 1(1), 39–54. https://doi.org
/10.1016/S0377-2217(77)81007-2
[10] Ijiri, Y. (1965). Management goals and accounting for control. North-Holland.
[12] Lee, S. M., & Clayton, E. R. (1970). Application of goal programming for a textile
industry. Review of Industrial Management and Textile Science, 6, 107–113.
[13] Ignizio, J. (1976). Goal programming and extension. Health Lexington Books.
[14] Gass, S. I.(1986). A process for determining properties and weights for large-scale linear
goal programs. Journal of the Operational Research Society, 37(8), 779–785. https://doi.org
/10.1057/jors.1986.138
[15] Romero, C. (1991). A handbook of critical issues in goal programming. Pergamon Press.
[16] Tamiz, M., Jones, D. F., & El-Darzi, E. (1995). A review of goal programming and its
applications. Annals of Operations Research, 58(1), 39–53. https://doi.org/10.1007/BF0203
2309
[17] Schniederjans, M. J., & Hoffman, J. (1992). Multinational acquisition analysis: A zero-
one goal programming model. European Journal of Operational Research, 62(2), 175–185.
https://doi.org/10.1016/0377-2217(92)90245-5
[19] Lee, S. M. (1972). Goal programming for decision analysis. Auerbach Publications, Inc.
15
[21] Tamiz, M., Jones, D., & Romero, C. (1998). Goal programming for decision making: An
overview of the current state-of-the-art. European Journal of Operational Research, 111(3),
569–581. https://doi.org/10.1016/S0377-2217(97)00317-2
[22] Ghosh, D., Sharma, D. K., & Mattison, D. M. (2005). Goal programming formulation in
nutrient management for rice production in West Bengal. International Journal of Production
Economics, 95(1), 1–7. https://doi.org/10.1016/j.ijpe.2003.09.018
[23] Leung, S. C. H., & Ng, W. (2007). A goal programming model for production planning
of perishable products with postponement. Computers and Industrial Engineering, 53(3),
531–541. https://doi.org/10.1016/j.cie.2007.05.010
[24] Larbani, M., & Aouni, B. (2011). A new approach for generating efficient solutions
within the goal programming model. Journal of the Operational Research Society, 62(1),
175–182. https://doi.org/10.1057/jors.2009.185
[25] Sinha, B., & Sen, N. (2011). Goal programming approach to tea industry of Barak
Valley of Assam. Applied Mathematical Sciences, 5, 1409–1419.
[26] Sen, N., & Nandi, M. (2012). A goal programming approach to rubber plantation
planning in Tripura. Applied Mathematical Sciences, 6(124), 6171–6179.
[27] Sen, N., & Nandi, M. (2012). An optimal model using goal programming for rubber
wood door manufacturing factory in Tripura.Mathematical Theory and Modeling,2(8),31–36.
[28] Sen, N., & Nandi, M. (2012). Goal programming, its application in management sectors-
special attention into plantation management: A review. Leveraging Technology for a
Sustainable World, 2(9), 19–24.
[29] Baran, P., Biswas, P., & Mukhopadhyay, A. (2013). Using genetic algorithm to goal
programming model of solving economic-environmental electric power generation problem
with interval-valued target goals. International Journal of Advanced Manufacturing
Technology, 64(9–12), 1715–1727.
[30] Anggraeni, W., Vinarti, R. A., Tyasnurita, R., & Permatasari, J. (2015). Production
planning optimization using goal programming method in Habibah Busana. Journal of
Advanced Management Science, 3(4), 270–275. https://doi.org/10.12720/joams.3.4.270-275
16
[31] Schniederjans, M. J., Schniederjans, D., & Cao, Q. (2017). Value analysis planning with
goal programming. Annals of Operations Research, 251(1–2), 367–382. https://doi.org/10.10
07/s10479-015-1882-9
[32] Yu, S., Zhang, S., Agbemabiese, L., & Zhang, F. (2017). Multi-stage goal programming
models for production optimization in the middle and later periods of oilfield development.
Annals of Operations Research, 255(1–2), 421–437. https://doi.org/10.1007/s10479-015-
1866-9
[33] Iskander, M.G. (2015). Exponential membership functions in fuzzy goal programming:
A computational application to a production problem in the textile industry. American
Journal of Computational and Applied Mathematics, 5(1), 1–6.
[34] Ighravwe, D. E., & Oke, S. A. (2015). A combined fuzzy goal programming and big-
bang big-crunch algorithm for workforce optimization with facility layout consideration.
Engineering Journal, 19(2), 71–98. https://doi.org/10.4186/ej.2015.19.2.71
[35] Hocaoğlu, M. F. (2019). Weapon target assignment optimization for land based multi-air
defense systems: A goal programming approach. Computers and Industrial Engineering, 128,
681–689. https://doi.org/10.1016/j.cie.2019.01.015
[36] Nesticò, A., Elia, C., & Naddeo, V. (2020). Sustainability of urban regeneration projects:
Novel selection model based on analytic network process and zero-one goal programming.
Land Use Policy, 99, 104831. https://doi.org/10.1016/j.landusepol.2020.104831
[37] Keynezhad, B., & Goharshenasan, A. (2022). A multi-purpose model for optimizing
project selection and activities scheduling by balancing resource allocation. International
Journal of Project Organisation and Management, 14(1), 20–35. https://doi.org/10.1504/IJO
M.2022.121556
[38] Zhang, Z., Zheng, W., Shao, W., Zhang, Y., Guo, D. (2022). Resource Allocation
for Multi-service NOMA System Based on Deep Reinforcement Learning. In: Zu, Q., Tang,
Y., Mladenovic, V., Naseer, A., Wan, J. (eds) Human Centered Computing. (pp. 219–231)
Lecture Notes in Computer Science, 13795. Springer. https://doi.org/10.1007/978-3-031-
23741-6_20
17
Signature of the Candidate
Outline Approved
18