Mathematical Problems in Engineering

Volume 2013, Article ID 791415, 10 pages

http://dx.doi.org/10.1155/2013/791415

## Assignment Problem for Team Performance Promotion under Fuzzy Environment

Department of Industrial Engineering and Management, TaHwa University of Science and Technology, No. 1 TaHwa Road, Cyong-Lin, HsinChu County 307, Taiwan

Received 27 November 2012; Revised 23 May 2013; Accepted 27 May 2013

Academic Editor: Asier Ibeas

Copyright © 2013 Chi-Jen Lin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper constructs a general fuzzy assignment problem (GFAP) based on a real-world scenario and proposes a solution procedure. Suppose a project team consists of workers and a manager. The workers are responsible for performing jobs and the manager for restraining the total cost. The corresponding cost for a worker to perform his assigned job is not defined deterministically but as a subnormal fuzzy interval with increasing linear membership function. Job quality is then linearly and positively related to the cost of the job and is taken as the performance of the worker. On the other hand, the performance of the manager is negatively related to the total cost and is defined as a fuzzy interval with a decreasing linear membership function. It is common practice for a company to regard the lowest performance among members as the team performance in order to increase overall team performance. Hence, using the max–min criterion, a mixed nonlinear programming model of the GFAP is constructed. The model can be transformed into a general 0-1 fractional programming problem with max–min objective function. An algorithm that combines simplex and trade-off approaches is proposed to solve the problem. A numerical example and the computational results show that the constructed model and the proposed algorithm are useful and efficient.

#### 1. Introduction

The assignment problem (AP) is a well-known and practical mathematical model. Given two disjoint -sets , and the set and , the AP can be stated as the following 0-1 programming problem:

Let denote a feasible solution of (1). In a simplex-type algorithm, is highly degenerate and consists of exactly variables with the value 1; the remaining variables have the value 0. Defining , constitutes the assignment corresponding to . Often (1) is practically interpreted as jobs that must be performed by workers at minimal total cost, and is the job cost associated with worker performing job . Here, implies that each job must be assigned to one and only one worker, and vice versa. In the model, all values are deterministic.

However, in many real-world applications, job costs are not deterministic. Fuzzy theory has been supported to slash the risk of improper models and solutions which do not reflect the practical problems [1]. In recent years, many researchers have investigated the AP and its variants under fuzzy environments. Sakawa et al. [2] dealt with production and workforce assignment problems of a housing material manufacturer. Belacela and Boulasselb [3] developed a multicriteria fuzzy AP (FAP) that they applied to medical diagnosis. Ridwan [4] investigated a fuzzy preference-based traffic assignment problem. Lin and Wen [5] investigated a kind of FAP with an upper bound constraint on total cost. Liu and Li [6] proposed a new fuzzy quadratic AP as well as a genetic algorithm to solve their problem. Feng and Yang [7] developed a two-objective fuzzy -cardinality AP. Liu and Gao [8] studied the fuzzy weighted equilibrium multijob AP. Bashiri and Badri [9] proposed an interactive method for group decision making based on incomplete information using the fuzzy linear assignment method. Mukherjee and Basu [10] introduced an intuitionistic FAP using similarity measures and described the solution procedures. An investigation into sensitivity analysis of FAPs can be found in Lin et al. [11].

In this paper, a general FAP (GFAP) of Lin and Wen [5] is presented and an efficient solution procedure is proposed. The GFAP excludes the upper bound constraint on total cost, which makes the model more complicated and expands the application area. In addition to the team performance in human resource management, the GFAP can be used to situations that equally emphasize the time and cost, the quality and quantity, the humanity and technology, and so forth. The remainder of this paper is structured as follows. In the next section, the GFAP is constructed as a mixed nonlinear programming model. In Section 3, the constructed model is transformed into a general 0-1 fractional programming problem. The proposed algorithm for solving this problem is described in Section 4. A numerical example is illustrated in Section 5. In Section 6, computational results and two special cases are discussed. Finally, conclusions and suggestions for further research are given in Section 7.

#### 2. Model Construction

Suppose that a project team consists of workers and a manager. The workers are responsible for performing jobs and the manager for restraining the total cost. In many applications, the cost of a job depends not only on the skill of the worker but also on the job quality achieved. In general, the higher the job quality achieved, the greater the job cost required, and since a worker’s performance is defined as job quality, the worker desires a job cost in order to raise his personal performance. On the other hand, the manager is required to restrain the total cost as much as possible. Thus, the total cost is negatively related to the performance of the manager. and denote the cost of worker performing job and the total cost, respectively.

Let denote the highest achievable job quality performed by worker . The membership function of job cost is defined as the monotonically increasing linear function shown in (2). In this function, is the minimum cost for worker performing job, and is the minimum cost associated with worker performing job to reach . When the input job cost lies between and , the job cost is linearly and positively related to the job quality, that is, the performance of the worker. However, any expense exceeding is inefficient since the quality can no longer be enhanced. Without loss of generality, it is assumed that . If in any feasible solution, there is no real expense; therefore is added to the following: denotes . Matrix is shown as follows: In addition, the values form the matrix , the values form the matrix , and the values form the matrix . Further, we define where is indeed the slope of the membership function.

The membership function of total cost is defined as the monotonically decreasing linear function shown in (5). and are the lower and upper bounds of , respectively. Total cost is related to the performance of the manager. When the total cost is lower than , his performance is 1; when the total cost is greater than , his performance is 0; and when the total cost lies between and , the total cost is linearly and negatively related to the performance of the manager. denotes the fuzzy interval : Since the performance of worker , denoted as , is the job quality achieved, then In addition, the performance of the manager, denoted as , is as follows:

Usually, the company takes the lowest performance among members of the team, including all workers and the manager, as the team performance in order to increase overall performance. To maximize, the performance of each team member has to be equally emphasized. Hence, the Bellman-Zadeh criterion [12], which maximizes the minimum of all membership functions corresponding to that solution, is selected for this problem. Therefore, or where is an element of a feasible solution X of (1). The FAP model can then be constructed as follows:

Utilizing the membership functions illustrated in (2) and (5), (10) can be represented as the following equivalent problem: where denotes the -cut of and is the corresponding total cost . Since , , and all are decision variables, (11) can be treated as a mixed nonlinear programming problem.

#### 3. Model Transformation

Let be a specific feasible assignment of (1), that is, of (10). If discussion is confined on , (11) can be simplified as follows:

Theorem 1. *Let be the optimal objective value of (12) corresponding to , then
*

*Proof. *Transforming (12) into a linear programming problem, we find the following:
The dual problem of (14) can then be obtained as follows:
By (14), holds for . According to the complementary slackness theorem,
or
Using (17) and (4), (15) can be simplified into the following:
The dual problem of (18) is as follows:
(19) can be rewritten as follows to complete the proof:

Obviously, depends on the given ; that is, is a function of . The following corollary is trivial.

Corollary 2. *Let be all of the feasible assignments of (1). are the corresponding optimal objective function values in (12). Let ; then (subsequently denoted by ) is the optimal assignment of (11) and (subsequently denoted by ) is the optimal objective function value in (11).*

By Theorem 1 and Corollary 2, (11) can be transformed to (21), which is a general 0-1 fractional programming problem:

#### 4. Solution Algorithm

Of course, (21) can be solved by branch and bound (B&B) algorithms. However, in this section the S&T algorithm—a hybrid algorithm employing simplex and trade-off approaches [13]—is proposed to obtain the optimal assignment and optimal objective function value in (21). There is a tradeoff between the total cost and the jobs quality achieved, that is, between the performance of manager and workers. The S&T algorithm balances the maximum of manager’s performance and the minimum of the workers’ performances to maximize team performance. Usually, some S&T algorithm procedures must be repeated several times to solve problems with different updated parameters. In each solution, the maximum of manager’s performance decreases (or remains unchanged) and the minimum of the workers' performances simultaneously increases until the maximal team performance is reached.

To obtain the maximal manager's performance, (22) is extracted from (21) as follows:

Since the constraints of (22) form a totally unimodular matrix and its objective function is a pseudomonotonic model [14], the condition in (22) can be replaced with . Furthermore, we can define and . Equation (22) then becomes equivalent to the following:

Equation (23) is a special linear fractional problem, that is, a fractional assignment problem. Some algorithms for solving fractional assignment problems have been developed by Shigeno et al. [15] and Kabadi and Punnen [14] who showed that the optimum of (23) can be found at an extreme point of its solution polyhedron. A simplex-type algorithm can then be employed to solve (23).

The S&T algorithm consists of initialization and optimization procedures. The initialization procedure is first performed in a transportation table, as shown in Figure 1. The FCMP method [16] is employed to obtain a basic feasible solution of the maximal-objective-function transportation problem with as the profit matrix and 1 as the amount of each supply and demand. is then used as the initial solution to (23), as shown in Figure 2. This is viewed as the fractional transportation problem [17]. Next, the objective function value of in (23) is determined and associates and with row and column , respectively. Set and identify the other and using the equation according to the basic variables of . Define the assignment as . Remove the degenerated basic variables of from the table.

Taking as the initial assignment, subprocedures mixed approaches of [5, 11, 18–20] are used repeatedly to improve . When for each , is the optimal assignment of (23). Based on , the other condition in (21) is extracted. Let then is the objective function value in (21) corresponding to . To find the assignment that maximizes the objective function value in (21), elements of matrix can be repeatedly changed so that decreases or remains constant and increases to improve until the optimal objective function value in (21) is reached. The proposed S&T algorithm consisting of initialization and optimization procedures is summarized as follows.

*Phase I*. Initialization

*Step 1*: Let and . Apply the FCMP method to get and .

*Step 2*: Determine all values of and according to .

*Step 3*: Remove the degenerate basic variables of and obtain .

*Phase II*. Optimization

*Step A*. Compute , for each . If all ; then proceed to Step E. Otherwise, choose as the pivot cell where .

*Step B*. Proceed with the following labeling procedure until further labeling is impossible or row has received a label. If row has been labeled, go to Step C; otherwise, go to Step D.

*Labeling Procedure*

(1)*Give label ** to column **.*(2)*If column ** has been labeled, label the row ** with **, where **.*(3)*If row ** has been labeled, label the nonlabeled column ** with **, where **.*

*Step C*. Form a unique cycle by following the labels in reverse order. In the cycle, every odd cell is , and every even cell is . The odd cells are the recipient cells and thus become ; the even cells are the donor cells, which become . Let remain unchanged if cell (,) is not in the cycle. The new assignment is obtained and is taken as the new . The objective function value corresponding to the new is taken as the new .

By keeping unchanged, the new values of and can be obtained by the following: where is the label of row.

Other new variables and related to the cycle can be obtained by keeping in the cycle. If the new values of and are not related to the cycle, hold unchanged and identify , where . Return to Step A.

*Step D*. Let and row labeled, but column is not labeled}, ; or if is a null set.

If row is labeled, is subtracted from ; and if column is labeled, is added to . Recompute for . If all , proceed to Step E. If still holds, take as the pivot cell; if , choose as the new pivot cell where . Replace with , with , and return to Step B.

*Step E*. Determine and . If , proceed to Step H; otherwise, proceed to Step F.

*Step F*. Let and . If , proceed to Step H; otherwise, proceed to Step G.

*Step G*. Update [], where

Revise the objective function value corresponding to . To renew and , hold unchanged and identify , where . Go back to Step A.

*Step H*. Terminate the algorithm. The current and are the optimal assignment and optimal value of (21), respectively.

#### 5. Numerical Example

In this section, for demonstration purpose, the S&T algorithm is applied to a numerical example.

Suppose the matrices [] and [] are then define matrices Specify the sum of maximal elements in each row of matrix [] as and the sum of minimal elements in each row of matrix [] as . Matrices [] and [] can be obtained as follows: The S&T algorithm is applied to solve (21).

*Phase I.* Set and . The FCMP method is used to obtain , as shown in Figure 1. Its corresponding objective function value can be obtained from (23).

Figure 2 shows all values of , , and . They are obtained from and .

*Phase II*. Each for is shown in Figure 2 the cell centers. Since all for , and . Because , let and . Since , replace with and update . The updated , , and are shown in Figure 3(a), which also shows the recomputed for each . (2, 2) is selected as the pivot cell in the labeling procedure. In Figure 3(a), the labels of row 2 and column 2 are given by the numbers in brackets on the left and top margins.

Since row 2 has not received a label in Figure 3(a), and are determined. Continuing to follow the steps of Phase II yields Figures 3(b)–3(d). Through this procedure, the optimal assignment and optimal value are obtained.

#### 6. Computational Experience

The computational test in this section verifies the efficiency of the proposed S&T algorithm. An index-based B&B algorithm is also used to solve (21). Both the S&T algorithm and the index-based B&B algorithm are coded in Visual Basic 6.0. They are compared with the global optimal function in the LINGO 11 package. All algorithms are run on an Intel Pentium III-500 CPU.

The sizes of the problems tested range from to . For each problem of size, numbers of uniform distribution between 10 and are randomly generated for and numbers between and are generated for the difference between and . Numbers with a uniform distribution between 0.6 and 1.0 are generated for . For each problem size, 30 problems are tested and the average computational times (in seconds) of the three approaches are shown in Table 1. These results show that from the perspective of computational time, the S&T algorithm is greatly superior to the LINGO package. In particular, the S&T algorithm is superior to the index-based B&B algorithm when dealing with an increasing problem size.

Depending on the random number generated, the manager or one of the workers may be the one who decides the team performance. Now, we move to a discussion of two special cases. In the first case, it is assumed that the company supports the team at any expense. Thus, and the computational results of the three approaches are shown in Table 2. They illustrate that, although a small problem size causes the B&B algorithm to perform faster, the S&T algorithm is still efficient. The elapsed time of the LINGO package is also reduced. However, the variances of the elapsed times of the B&B algorithm and the LINGO package are large. Practically, causes the membership function in (5) to approach . Thus, the manager is never the one who determines the team performance. The workers also obtain sufficient expenses and can all reach their highest quality (performance). The team performance is decided by one of the workers. Therefore, simplifies (21) to the following: In fact, problem (30) is a variant of the bottleneck AP. Hence, a proper algorithm for the bottleneck AP will improve the efficiency of (21) if is known in advance.

In the second special case, is small; that is, the budget is insufficient for the team and none of the workers can reach the highest quality (performance) with the provided money. The computational results of the three approaches are shown in Table 3. It is clear that the proposed S&T algorithm is the most efficient. The elapsed time of the LINGO package is shorter than the value in Table 1; however, that of the index-based B&B algorithm is longer. In this case, the team performance is therefore chiefly determined by the manager and for all in the objective function of (21) is redundant. Thus, Problem (21) can then be simplified to (22) and can be solved with Phase I and Steps A, B, C, and D of Phase II of the proposed S&T algorithm.

An overview of Tables 1–3 reveals that, among the three approaches, the S&T algorithm is the most efficient.

#### 7. Conclusion

This study formulated a GFAP to overcome the uncertain environment in practice and developed the S&T algorithm to solve the problem. A numerical example was presented to demonstrate the solution procedure and the computational results of the S&T algorithm were compared with those of the B&B algorithm and the LINGO package. The results show that, when all aspects are considered, the S&T algorithm is the most useful and efficient. In terms of future research, the development of a sensitivity analysis procedure for modifying the membership function could be an interesting field of study with many potential applications.

#### References

- H. J. Rommelfanger, “The advantages of fuzzy optimization models in practical use,”
*Fuzzy Optimization and Decision Making*, vol. 3, no. 4, pp. 295–309, 2004. View at Publisher · View at Google Scholar · View at Scopus - M. Sakawa, I. Nishizaki, and Y. Uemura, “Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: a case study,”
*European Journal of Operational Research*, vol. 135, no. 1, pp. 142–157, 2001. View at Publisher · View at Google Scholar · View at Scopus - N. Belacela and M. R. Boulasselb, “Multicriteria fuzzy assignment method: a useful tool to assist medical diagnosis,”
*Artificial Intelligence in Medicine*, vol. 21, pp. 201–207, 2001. View at Google Scholar - M. Ridwan, “Fuzzy preference based traffic assignment problem,”
*Transportation Research Part C*, vol. 12, no. 3-4, pp. 209–233, 2004. View at Publisher · View at Google Scholar · View at Scopus - C.-J. Lin and U.-P. Wen, “A labeling algorithm for the fuzzy assignment problem,”
*Fuzzy Sets and Systems*, vol. 142, no. 3, pp. 373–391, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Liu and Y. Li, “The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm,”
*Applied Mathematics and Computation*, vol. 174, no. 2, pp. 1229–1244, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Feng and L. Yang, “A two-objective fuzzy $k$-cardinality assignment problem,”
*Journal of Computational and Applied Mathematics*, vol. 197, no. 1, pp. 233–244, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - L. Liu and X. Gao, “Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm,”
*Applied Mathematical Modelling*, vol. 33, no. 10, pp. 3926–3935, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Bashiri and H. Badri, “A group decision making procedure for fuzzy interactive linear assignment programming,”
*Expert Systems with Applications*, vol. 38, no. 5, pp. 5561–5568, 2011. View at Publisher · View at Google Scholar · View at Scopus - S. Mukherjee and K. Basu, “Solution of a class of Intuitionistic Fuzzy Assignment Problem by using similarity measures,”
*Knowledge-Based Systems*, vol. 27, pp. 170–179, 2012. View at Publisher · View at Google Scholar · View at Scopus - C.-J. Lin, U.-P. Wen, and P.-Y. Lin, “Advanced sensitivity analysis of the fuzzy assignment problem,”
*Applied Soft Computing Journal*, vol. 11, no. 8, pp. 5341–5349, 2011. View at Publisher · View at Google Scholar · View at Scopus - R. E. Bellman and L. A. Zadeh, “Decision-making in a fuzzy environment,”
*Management Science*, vol. 17, pp. B141–B164, 1970. View at Google Scholar · View at MathSciNet - S. Geetha and M. N. Vartak, “Time-cost tradeoff in a three-dimensional assignment problem,”
*European Journal of Operational Research*, vol. 38, no. 2, pp. 255–258, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. N. Kabadi and A. P. Punnen, “A strongly polynomial simplex method for the linear fractional assignment problem,”
*Operations Research Letters*, vol. 36, no. 4, pp. 402–407, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Shigeno, Y. Saruwatari, and T. Matsui, “An algorithm for fractional assignment problems,”
*Discrete Applied Mathematics*, vol. 56, no. 2-3, pp. 333–343, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - V. D. Joshi and N. Gupta, “A heuristic for obtaining a better initial solution for the linear fractional transportation problem,”
*Australian Society of Operations Research Bulletin*, vol. 28, pp. 45–49, 2009. View at Google Scholar - I. M. Stancu-Minasian,
*Fractional Programming—Theory, Methods and Applications*, vol. 409 of*Mathematics and Its Applications*, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997. View at Publisher · View at Google Scholar · View at MathSciNet - M. L. Balinski and R. E. Gomory, “A primal method for the assignment and transportation problems,”
*Management Science*, vol. 10, pp. 578–593, 1964. View at Google Scholar - C.-J. Lin, “Determining type II sensitivity ranges of the fractional assignment problem,”
*Operations Research Letters*, vol. 39, no. 1, pp. 67–73, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C.-J. Lin, “A labeling algorithm for the sensitivity ranges of the assignment problem,”
*Applied Mathematical Modelling*, vol. 35, no. 10, pp. 4852–4864, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet