An Optimal Assignment Schedule of Staff-Subject Allocation

Show more

1. Introduction

There is a well-known class of linear programming problems which are commonly referred to as the “assignment family”. The assignment family is a large class of problems which can generally be defined as an application used to assign “individuals” to “tasks” (or tasks to machines, etc.) subject to restrictions with the objective of minimizing the total cost of the assignment made (Kaye, 1985) [1] . The classical assignment problem (also referred to as the linear assignment problem) can be regarded as the most basic sub-class in the assignment family, the linear assignment problem requires all the tasks to be assigned to an agents on one-to-one basis, in the best combination in order to minimize cost. Therefore, it is assumed that each task can only be assigned once to an agent and each agent can only undertake one task. The other classes in the assignment family can be seen as an extension of the classical (linear) assignment problem. All classes of assignment problem have the following characteristics: 1) The overall objective is to minimize the cost of assigning tasks; 2) Binary decision variable are used to indicate when a task is completed; 3) Each task can only be assigned once; and 4) Functions must be linear or have the ability to be converted into a linear nature.

The assignment problem (AP) is used worldwide in solving real world problems. An assignment problem plays an important role in industry and other applications. It is one of the well-studied optimization problems in management science and has wide applications in both manufacturing and service system (Srinivas and Genesan, 2015) [2] . The assignment problem is one of the fundamental combinatorial optimization problem (or operation research) in mathematics, it is a particular case of transportation problem where the sources are assignee and the destinations are task (Ahmad and Ahmad, 2014) [3] .

Therefore, assignment problem is nothing rather than a balanced transportation problem in which all the supplies and demands are equal to one and involves efficient assignment of: jobs to machine, people to projects, contract to bidders, salespeople to territories, vehicles to routes, product to factories, development engineering to several construction site, etc. The objective is to minimize total cost or total time of performing the tasks at hand. One important characteristic of assignment problem is that only one job or worker is assigned to one machine or project. Each assignment problem has associated with a table or matrix, generally the rows contains the objects or people we wish to assign and the column comprise the things or tasks we want to assign to. The numbers in the table or entries in the matrix are costs associated with a particular assignment.

The specific problem in view is to model the staff-subjects allocation of Dutse Model International School of Jigawa State as an assignment problem and to find the optimal assignment (allocation) that will maximize the educational quality. The school existed for so many years as Dutse Capital School which later was renamed as Duste Model International School due to the advancement and the societal needs of the people in 2001. The Dutse Model International School was officially commissioned by his excellency General Ibrahim Badamasi Babangida (GCFR) the former president of the Federal Republic of Nigeria on Sunday 26^{th} August, 2012 AD (9 Shawwal, 1433 AH). The school has a total enrollment of 1365 students comprising boys and girls. The school participated and received a numerous number of Mathematical medals and awards among which includes:

Ø National Cowbell Mathematics Competition Senior Category 2^{nd} Position (2015).

Ø National Quiz Mathematics Competition on Nigerian Capital Market 2^{nd} Position (2014).

The research is of paramount importance as it seeks to find the optimal assignment schedule of staff-subjects allocation that will helps in promoting Teaching-Learning Processes, thereby improving the educational quality and national development in general. The research covers Dutse Model International Secondary School of Jigawa State. Therefore, the broad aim of this research is to determine the optimal assignment (allocation) schedule of five subjects to five different staffs (Teachers), on one-to-one basis. By applying the Hungarian method and determining the best way of allocating subject-staff, it will, to a large extent enhance the number of mathematical medals and awards.

The paper is structured into six parts: part one cover the introduction; the second part dealt with literature review; the third part dwells on material and methods; the fourth part captures the analysis and results; fifth part concludes the paper.

2. Literature Review

Linear Programming (LP) can be defined as a mathematical method of determining an optimum assignment of interdependent activities, given the availability of resources (Loomba, 1964) [4] . Linear Programming formulations were first recognized in the late 1940’s when G. B. Dantzig designed the “Simplex method” for solving problems arising within the US Air Force (see Chevatal, 1983 [5] ; Ignizio, 1982 [6] ). Since then, the development of linear programming has made it an extensively used technique for solving a wide range of managerial problems. The linear programming model is a structured set of mathematical relationships (e.g. equalities, logical conditions), which represent an abstraction of the real problem under consideration (Williams, 1995) [7] .

The assignment problem as a class of linear programming problem was developed and published by Harold Kuhn in 1955, who gave the name “Hungarian Method” because the algorithm was largely based on the earlier work of two Hungarian mathematicians: Denes Koning and Jeno Egervary. However, Simon (2012) [8] used assignment problem techniques to model and solves the staff-subject assignment problem as an assignment problem. The objective of the model is to maximize the educational quality; the model developed could be adopted for any problem that can be modeled as an assignment problem. Furthermore, De and Yadav (2012) [9] studied two different types of assignment problem: conventional and fuzzy assignment problems and develops an approach to solve the fuzzy assignment problem where the cost is not deterministic numbers but imprecise ones. Here the elements of the cost matrix of the assignment problem are triangular fuzzy numbers. In conventional assignment problem, the cost is always certain. Also, Ghadle and Muley (2013) [10] introduced a new approach to assignment problem namely “Revised Ones Assignment Method (ROA)” for solving a wide range of problem. In ROA Method defines assignment matrix, then reduced the matrix till it has least one in each row and column.

Moreover, Thiruppathi and Iranian (2015) [11] presented an innovative method named by TVAM is proposed to find an optimal solution for any assignment problem in single stage. Here the assignment is solved to get optimal solution directly. Micheal et al., (2008) [12] considered the assignment problem in the context of network systems where the main challenge is dealing with the lack of global information due to the limited communication capabilities of agents. The algorithm is an extension to the parallel auction algorithm. Moreover, Majumdar (2013) [13] proposed interval Hungarian method and consider interval analysis concept for solving interval linear assignment problem in the cost matrix is not always crisp. Likewise, Ahmad and Ahmad (2014) [3] presented a new method for finding an optimal solution of a wide range of assignment problem directly. A numerical illustration is established and the optimality of the result yielded by this method is also checked.

Besides, Kotwal and Dhope (2015) [14] proposed a modified assignment model for the solution of assignment problem with the help of numerical examples or problem is solved to show its efficiency and also its comparison with the Hungarian method is shown. A new cost is achieved by using unbalanced assignment problem. Also, Srinivas and Ganesan (2015) [2] presented a fuzzy assignment problem has been transformed into Crip assignment problem in the linear programming problem form and solved by using Branch and Bound and Robust’s ranking method for the fuzzy numbers. Moreover, Semih et al., (2008) [15] considered a distribution-type warehouse assignment problem that various type of products were collected from different suppliers for storing in the warehouse for a determined period and for delivery to different customers. Their study was to design a multiple-level warehouse shelf configuration which minimized the annual carrying costs.

Similarly, Maxon and Bhadury (2001) [16] studied a multi-period assignment problem with repetitive tasks and tried to introduce a human element into the analysis. Their objectives was to minimize a combination of the assignment cost and the “boredom” that the results when a workers are required to repeat the same task in consecutive periods. A mathematical model was proposed and a simple iterative heuristic was developed and implemented in Excel. Furthermore, Mingfang (2010) [17] studied the Weapon-Target Assignment (W.T.A) problem, which has wide application in the area of defense-related operation research. This problem calls for finding a proper assignment of weapons to target such that the total expected damaged value of the targets to be minimized. The WTA problem can be formulated as a nonlinear integer programming problem which is known to be NP-complete. Also, Liong et al., (2006) [18] solve a special Quadratic Assignment Problem (Q.A.P) which consists of deciding the assignment of customers to loading positions as well as fulfilling their demands, i.e. a double problem. They applied the Greedy Algorithm to set a good initial solution, and then a modified Genetic Algorithm to find the best solution to the problem. Besides, Simon (2012) [8] modeled the staff subject’s assignment as an assignment problem. The developed model can be adopted for any problem that can be modeled as an assignment problem. A wrong decision may result in significant loss of value due to understaffing, under-qualification or over-qualification of assigned personal and high turnover of poorly matched workers.

However, Sarin et al., (2010) [19] develop the integer programming formulation for a university-timetabling problem with the objective of minimizing the total distance travelled by the lecturers from their offices to the classrooms. Similarly, Oladokun and Badmus (2008) [20] studied about assigning a number of courses to classrooms taking into consideration constraints like classroom capacities and the university regulations and using the integer linear programming (ILP) to solve the problem.

The limitations of previous works: Thiruppathi and Iranian (2015) [11] used single stage assignment problem while ours is multiple stage assignment; Micheal et al., (2008) [12] has limited communication capabilities of agents; Majumdar (2013) [13] used interval Hungarian method whereas Kotwal and Dhope (2015) [14] shows efficiency and comparison with the Hungarian method; also, Srinivas and Ganesan (2015) [2] presented a fuzzy assignment problem. While, Simon (2012) [8] is consistent to some extent with our work but a wrong decision may result in significant loss of value due to understaffing, under-qualification or over-qualification of assigned personnel and high turnover of poorly matched workers. The only difference is we consider staff-subject allocation which will help in promoting teaching-learning process, thereby improving educational quality.

3. Material and Methods

The study covers data gathered from the period of two academic sessions (2014/15-2015/16). One of the most widely used methods for solving assignments is called the “Hungarian Method” developed and published by H. W. Kuhn in 1955 (see Kuhn, 1955) [21] . This method is named after the Hungarian mathematicians D. Koning who in 1916 proved the theorem necessary for the development of the method.

The Hungarian method (also known as Flood’s Technique or the reduced matrix method) of assignment problem, it provides us with an efficient means of finding the optimal solutions without having to make direct comparison of every option. It operate on a principle of matrix reduction which means that by subtracting and adding appropriate numbers in the cost table or matrix, we can reduce the problem to a matrix of opportunity cost (opportunity cost show the relative penalties associated with assigning any workers to a job or least cost assignment). If we can reduce the matrix to a point where there is one zero element in each row and column, then it is possible to make optimal assignment, for example, assignment schedule are made in such a way that the opportunity cost for assignment is zero. The Hungarian method of assignment problem is typically minimization case (Singh et al., 2012) [22] .

3.1. Assignment and Allocation Problem

The assignment problem is a special type of transportation problem which is also a resources allocation problem. Here, we have n-jobs to be performed by n-machines and the problem is how to distribute the job to the different machines involved. This problem has extensive applications in allocation problem where different entities are allocated or assigned to other entities. The objective function in assigning different jobs to different machines is to find the optimal assignment (allocation) that will minimize the total cost or time taken to finish all the jobs by the machines.

The assignment problem can be formally stated as follows: Given n-tasks and n-machines, the problem is to assign or allocate the tasks and machine such that each task is assigned to exactly one machine and each machine to only one task. There is a cost of allocating i^{th} task to j^{th} machine which is denoted by [c_{ij}] and the objective is to minimize the total cost or time of this allocation.

3.2. General Formulation of Assignment Problem

Consider the problem of assigning n-jobs to n-machines, job i when assigned to machine j incur a cost of C_{ij} for
$i=1,2,3,\cdots ,n$ and
$j=1,2,3,\cdots ,n$ and the objective function is to assign (allocate) jobs to machines on one-to-one basis (i.e. one machine one job), so that the total cost is minimum.

3.2.1. The Binary Decision Variables

The binary decision variable in assignment problem model holds only for the binary digits.

${X}_{ij}=\{\begin{array}{l}1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\text{job}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{assignedtomachine}\text{\hspace{0.17em}}j\\ 0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{otherwise}\end{array}$

3.2.2. Objective Function

The function to be minimize subject to the given constraints is called the objective function and denoted by letter Z. Consider the allocation of n-jobs to n-machines which is associated with a cost C_{ij} and let X_{ij} be a binary decision variable for this assignment. Since we assumed that the total cost function is linear. Therefore, the total cost function of this assignment is given by C_{ij} × X_{ij}. The objective function to be minimized is given by:

Minimized $Z={{\displaystyle \sum}}_{i=1}^{n}{{\displaystyle \sum}}_{j=1}^{n}\text{\hspace{0.05em}}{C}_{ij}{X}_{ij}$ .

3.2.3. Constraint

The constraints are conditions that force the machine assigned to meet the demand of the job. However, an assignment problem is a special case of transportation problem model in which the workers (machine) represent the source origin and the tasks (jobs) represent the destination. In assignment problem the machines and the jobs constraint are unity (Ragsdale, 2010) [23] .

1) Machine constraint:

${{\displaystyle \sum}}_{j=1}^{n}\text{\hspace{0.05em}}{X}_{ij}=1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}j=1,2,3,\cdots ,n$

2) Job constraints:

${{\displaystyle \sum}}_{i=1}^{n}\text{\hspace{0.05em}}{X}_{ij}=1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}i=1,2,3,\cdots ,n$

3) Non-negativity:

${X}_{ij}\ge 0$ for all $i=1,2,3,\cdots ,n$ and $j=1,2,3,\cdots ,n$

The condition that ${X}_{ij}\ge 0$ is satisfied since ${X}_{ij}=0$ or 1 for i, j.

3.2.4. Formulation

Let X_{ij} denote the assignment of i^{th} job to j^{th} machine and C_{ij} denote the time or cost of effective assignment i^{th} job to j^{th} machine for
$i=1,2,3,\cdots ,n$ and
$j=1,2,3,\cdots ,n$ .

Then, the assignment problem can be formulated below:

Minimize $Z={{\displaystyle \sum}}_{i=1}^{n}{{\displaystyle \sum}}_{j=1}^{n}\text{\hspace{0.05em}}{C}_{ij}{X}_{ij}$ (3.1)

Subject to

${{\displaystyle \sum}}_{i=1}^{n}\text{\hspace{0.05em}}{X}_{ij}=1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}i=1,2,3,\cdots ,n$ (3.2)

${{\displaystyle \sum}}_{j=1}^{n}\text{\hspace{0.05em}}{X}_{ij}=1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}j=1,2,3,\cdots ,n$ (3.3)

${X}_{ij}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{for}\text{\hspace{0.17em}}\text{all}\text{\hspace{0.17em}}i=1,2,3,\cdots ,n\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{and}\text{\hspace{0.17em}}\text{\hspace{0.05em}}j=1,2,3,\cdots ,n$

where;

${X}_{ij}=\{\begin{array}{l}1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\text{job}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{assignedtomachine}\text{\hspace{0.17em}}j\\ 0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{otherwise}\end{array}$

${C}_{ij}$ = The cost or time of assigning job i to machine j (monetary unit, time unit)

n = Equal number of machines and jobs available

3.3. The Assignment Problem Matrix

Each assignment problem is associated with a table or a matrix called the cost or effectiveness matrix. Generally, the rows contain the workers or machines we wish to assign and the column comprise jobs or tasks we want to assign to them. Consider the problem of assigning n-jobs to n-machines and the overall objective function is to minimize the cost or time in such a way that each machine is associated with only one and only one job. The cost matrix [C_{ij}] is given in the Table 1.

The cost matrix of the assignment problem is the same as that of a transportation problem except that the availability at each resources and the requirement at each destination is 1.

3.3.1. A Balanced Assignment Problem

The assignment problem is to be balanced if the cost matrix has equal number of rows and columns or equivalently, if the given problem is a square matrix (i.e. n × n matrix). Otherwise is said to be unbalanced, a dummy variable must be added to balance the problem.

Table 1. The matrix table for assignment schedule.

3.3.2. Method for Solving Assignment Problem

There are numerous methods for solving linear assignment problems from the general simplex algorithm to complex techniques. The most famous specific method for solving assignment problem is called the “Hungarian Method”. The method provides us with an efficient and effective way to get an optimal assignment that will minimize the cost or time.

According to Simon (2012) [8] assignment problem model comes under the class of linear programming model, which is similar to transportation problem model with an objective function of minimizing the time or cost of manufacturing the products by allocating one job to one machine or one machine to one job or one destination to origin or one origin to one destination only. Basically, assignment problem model is a minimization model. If we want to maximize the objective function, one of the two methods is possible; subtract the entire element in the matrix from the highest element in the matrix, or multiply the entire matrix by −1.

1) Balanced Assignment: Assignment problem is said to be balanced if there is equal number of rows and column or equivalently, if the given problem is a square matrix (i.e. n × n matrix).

2) Unbalanced Assignment: The assignment problem is said to be unbalanced if it is not balanced.

3.3.3. Solution Algorithm for Solving Assignment Problem

The algorithms for Hungarian method of assignment problem are summarized below:

Step 1: Find the cost matrix if it not given.

Step 2: Find the minimum cost of allocation in each row and column.

Step 3: Perform row reduction process that will create an equivalent cost matrix that has zero element(s) in every row by subtracting the smallest cost element(s).

Step 4: Perform a column reduction process if in the cost matrix has any column without zero elements by subtracting the smallest element in that column.

Step 5: If a single machine is assigned to more than one jobs, then go to step 6 else go to step 7.

Step 6: Carryout crossing of zeros by drawing minimum number of lines to cross all zeros. Then, select the smallest of uncrossed elements and subtract it from every other uncrossed element and add it to every element at the intersection of two lines.

Step 7: Make job allocation to machine.

4. The Analysis and Results

The head of the staff has the problem of allocating teachers to five different subjects which includes: Mathematics, English, Physics, Chemistry and Biology offered by science class in his school. He has availability of five staffs named A, B, C, D, and E graduates teachers who have handled or taught at least one of these subjects in the past two academic sessions and have been evaluated with a score from 0 to 100 (Basic rating = 100) regarding the ability of each staff to each subject respectively. The scores are shown in the Table 2, below.

The problem now is how the head should assign his staff to the subject on one-to-one basis so as to maximize the educational quality of his school in sciences. If he decide to apply the Hungarian method as a criterion for judging who should teach each subject. Since the assignment problem (Hungarian method) deals with minimization problems, the above maximization problem can be reduced to minimization problem by finding the opportunity or regret matrix, as shown in the Table 3.

Table 2. Staff rating scores.

Table 3. Opportunity matrix scores.

The problem can be modeled below as:

Minimize: $Z={{\displaystyle \sum}}_{i=0}^{n}{{\displaystyle \sum}}_{j=0}^{n}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{S}_{ij}{X}_{ij}$ (4.1)

Subject to:

${{\displaystyle \sum}}_{i=0}^{n}\text{\hspace{0.05em}}{X}_{ij}=1$ (4.2)

${{\displaystyle \sum}}_{j=0}^{n}\text{\hspace{0.05em}}{X}_{ij}=1$ (4.3)

X_{ij} ≥ 0 for all i = 1, 2, 3, 4, 5 and j = 1, 2, 3, 4, 5

where;

S_{ij} = the opportunity score of assigning teacher i to subject j

${X}_{ij}=\{\begin{array}{l}1,\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\text{teacher}\text{\hspace{0.17em}}i\text{\hspace{0.17em}}\text{isassignedtomeetthedemandofsubject}j\\ 0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{otherwise}\end{array}$

n = equal number of staffs and subjects

Hence, the problem becomes (as shown in Table 4):

Minimize: $\begin{array}{c}Z=23{X}_{11}+17{X}_{12}+15{X}_{13}+27{X}_{14}+15{X}_{15}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+15{X}_{21}+31{X}_{22}+27{X}_{23}+34{X}_{24}+19{X}_{25}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+14{X}_{31}+28{X}_{32}+22{X}_{33}+25{X}_{34}+18{X}_{35}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+33{X}_{41}+17{X}_{42}+14{X}_{43}+19{X}_{44}+19{X}_{45}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+26{X}_{51}+22{X}_{52}+15{X}_{53}+\text{}20{X}_{54}+16{X}_{55}\end{array}$

Subject to:

${X}_{11}+{X}_{12}+{X}_{13}+{X}_{14}+{X}_{15}=1$

${X}_{21}+{X}_{22}+{X}_{23}+{X}_{24}+{X}_{25}=1$

${X}_{31}+{X}_{32}+{X}_{33}+{X}_{34}+{X}_{35}=1$

${X}_{41}+{X}_{42}+{X}_{43}+{X}_{44}+{X}_{45}=1$

${X}_{51}+{X}_{52}+{X}_{53}+{X}_{54}+{X}_{55}=1$

${X}_{11}+{X}_{21}+{X}_{31}+{X}_{41}+{X}_{51}=1$

${X}_{12}+{X}_{22}+{X}_{32}+{X}_{42}+{X}_{52}=1$

${X}_{13}+{X}_{23}+{X}_{33}+{X}_{43}+{X}_{53}=1$

${X}_{14}+{X}_{24}+{X}_{34}+{X}_{44}+{X}_{54}=1$

${X}_{15}+{X}_{25}+{X}_{35}+{X}_{45}+\text{}{X}_{55}=1$

This result is not optimal, so we cannot make assignment. We compute the next step in the algorithm as shown in Table 5.

Since, more than one subject is assigned to one teacher. Then we carry out crossing of zeros by drawing minimum number of vertical and horizontal lines to cover all zeros as shown in Table 6.

Table 4. Row reduction.

Table 5. Column reduction.

Table 6. Crossing of zeros.

The result is not optimal, now select the least of uncrossed element and subtract it from every other uncrossed element and add it to every element at intersection of two lines as shown in Table 7.

This result is optimal, so we can make the allocations.

(A, English) Þ Teacher A → English

(B, Mathematics) Þ Teacher B → Mathematics

(C, Biology) Þ Teacher C → Biology

(D, Physics) Þ Teacher D → Physics

(E, Chemistry) Þ Teacher E → Chemistry

Moreover, anywhere we see zero elements, it is possible to make allocation, i.e. we can allocate B Mathematics and find another possible space for C. We allocate only A to take English; B for Mathematics; C, we allocate Biology; staff D can be allocated either Physics or Chemistry; and staff E can be allocated either Chemistry or Physics.

The total minimum opportunity that will maximize the total educational quality is given below:

Total minimum $Z=17+15+18+14+20=84$

Also, $Z=17+15+18+15+19=84$

Using Equation (4.1) above we have: Z = 84. Therefore, the total maximum effectiveness that will maximize the educational quality is given in Table 8.

Therefore the total maximum effectiveness = 416.

The result from both Hungarian algorithm and that of LINGO computer software package yielded the same optimal outcome. The computer solution by LINGO software shows that the total minimum opportunity that will maximize the educational quality is 84 and the total maximum effectiveness that will

Table 7. The least uncrossed elements.

Table 8. Optimal assignment.

maximize the education quality is 416.

5. Conclusions

The staff-subject allocation problem of Dutse Model International School has been addressed. The Hungarian algorithm was used to solve the staff-subject allocation problem. The research focused on the use of the assignment problem for selection of staffs to a given subject in order to obtain the best quality results from a teacher. The Hungarian assignment algorithm and Linear Interactive & Discrete Optimization (LINGO) Software Package were used to maximize the total effectiveness of teaching-learning process of the school. The Hungarian algorithm and LINGO software package yielded the same optimal result. The research seeks to solve the real-life problem in the service (educational) industry of staff-subject allocation problem using the Hungarian algorithm. It was found that the solution that gave a minimum and maximum achievable result for assigning a teacher to a subject was 84 and 416 respectively.

The use of Hungarian algorithm approach gives a systematic and transparent solution as compared with LINGO computer software package which produced the same optimal allocation policy of the school staffs to various subjects to gives a better result. The management may benefit from the proposed approach for selection of staff to subject to guarantee optimal result from the staff. We therefore recommend that the assignment problem model should be adopted by the schools in staff-subject allocation so as to get better medal rewards in the future.

Appendix

References

[1] Kaye, S. (1985) Combinatorial Optimization: Algorithms and Complexity. Dover Books, 27-31.

[2] Srinivas, B. and Ganesan, G. (2015) Method for Solving Branch-and-Bound Techniques for Assignment Problems Using Triangular and Trapezoidal Fuzzy Numbers. International Journal of Management and Social Science, 3(3): 7-10. Retrieved 23rd Nov, 2015, from

https://www.researchgate.net

[3] Ahmad, A. and Ahmad A. (2014) A New Method for Finding an Optimal Solution of Assignment Problems. International Journal of Modern Mathematics Sciences, 12(1): 10-15. Retrieved December 9, 2015, from

http://modernscientificpress.com/journals/ijmms.aspx

[4] Loomba, P.N. (1964) Linear Programming. McGraw-Hill, New York, 31-39.

[5] Chevatal, V. (1983) Linear Programming Techniques. Freeman and Company, New York, 2nd Edition, 15-20.

[6] Ignizio, J.P. (1982) Linear Programming in Single and Multiple Objective System. Prentice Hall International, Inc., New Jersey, 17-27.

[7] Willams, H.P. (1995) Model Building in Mathematical Programming. Wiley, UK.

[8] Simon, K. (2012) Staff Assignment Problem. Unpublished M.Sc. Thesis, Institute of Distance Learning, Ghana.

[9] De, P.K. and Yadav, B. (2012) A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients. Journal of Modern Applied Science, 6, 8-14. Retrieved December 25, 2015, from

https://www.researchgate.net

http://doi.org/10.5539/mas.v6n3p2

[10] Ghadle, K.P. and Muley, Y.M. (2013) Revised Ones Assignment Method for Solving Assignment Problem. Journals of Statistics and Mathematics, 4(1): 7-12. Retrieved January 25, 2016, from

https://bioinfopublication.org/jouarchive.php?opt=&jouid=BPJ0000285

[11] Thiruppathi, A. and Iranian, D. (2015) An Innovative Method for Finding Optimal to Assignment Problems. International Journal of Innovative Research in Sciences Engineering and Technology, 4, 9-11.

[12] Michael, N., Zavlanos, M., Kumar, V. and Pappas, G. (2008) Distributed Multi-Robot Assignment and Formation Control. IEEE International Conference on Robotics and Automation, Pasadena, 19-23 May 2008, 128-133.

https://doi.org/10.1109/ROBOT.2008.4543197

[13] Majundar, S. (2013) Interval Linear Assignment Problems. Journal of Applied Mathematics, 1, 14-16.

http://www.hrpub.org

[14] Kotwal, J.G and Dhope, T.S. (2015) Unbalanced Assignment Problem Using Modified Approach. International Journal of Advanced Research in Computer Science and Software Engineering, 5, 4-11.

http://www.ijarcsse.com

[15] Onüt, S., Kara, S.S. and Efendigil, T. (2008) A Hybrid Fuzzy MCDM Approach to Machine Tool Selection. Journal of Intelligent Manufacturing, 19, 443-453.

[16] Maxon, S.L. and Bhadury, J. (2001) An Ms-Excel Implementation of a Multi-Period Assignment Problem with Repetitive Tasks. In: Proceedings of the 13th Annual CSU-POM Conference, California State University San Bernardino, 39-48.

[17] Ni, M., Yu, Z., Ma, F. and Wu, X. (2010) A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem. Unpublished Thesis, Institute of Communication Engineering.

[18] Liong, C.Y., Wan, R.I. and Mourad, Z. (2006) Application of Genetic Algorithm in a Special Quadratic Assignment Problem. Proceedings of 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications, Penang, 13-15 June.

[19] Sarin, S.C., Wang, Y. and Varadaraja, A. (2010) A University-Timetabling Problem and Its Solution using Bender’s Partitioning—A Case Study. Journal of Scheduling, 13, 6-9.

https://doi.org/10.1007/s10951-009-0157-1

[20] Oladokun, V.O. and Badmus, S.O. (2008) An Integer Linear Programming Model of University Course-Timetabling. Pacific Journal of Science and Technology, 9, 4-10.

[21] Kuhn, H.W. (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2, 83-97.

https://doi.org/10.1002/nav.3800020109

[22] Singh, S., Dubey, G.C. and Shrivastava, R. (2012) A Comparative Analysis of Assignment Problem. IOSR Journal of Engineering, 2, 1-15.

https://doi.org/10.9790/3021-02810115

[23] Ragsdale, C.T. (2010) Spread Sheet Modeling & Decision Analysis: A Practical Introduction to Management Science. 6th Edition, South-Western College Publisher.