Submitted:
11 October 2024
Posted:
28 October 2024
You are already at the latest version
Abstract
Keywords:
1. Introduction
2. Literature Review
2.1. Historical Background:
2.2. Current Approaches:
2.3. Gap in Literature:
3. Methodology
3.1. Model Formulation:
- Objective Function: Minimize the total deviation from the ideal workload for all faculty members. This involves calculating the difference between actual and ideal workloads for each faculty member and minimizing this total difference across the institution.
- Variables: Each variable represents the workload (in hours) allocated to a faculty member for a specific type of duty e.g. (teaching, research, administration).
-
Constraints: The model includes constraints to ensure that:
- o
- The total workload for each faculty member does not exceed the maximum allowable hours.
- o
- Each course or administrative task is assigned to exactly one faculty member.
- o
- Faculty preferences and qualifications are considered in the allocation of duties.
3.2. Simplex Method Overview:
3.2.1. Implementation Steps:
- Data Collection: Gather data on faculty preferences, qualifications, and current workloads, as well as information on available courses and administrative tasks.
- Model Setup: Translate the collected data into the mathematical model, defining the objective function, variables, and constraints.
-
Solution Process:
- Convert the problem into standard form for the simplex method.
- Use the simplex algorithm to iterate through feasible solutions.
- Identify the optimal solution based on the objective function.
3.3. Python Implementation:
- Define the coefficients of the objective function and the constraints matrix based on the model formulation.
- Input the data into the ‘linprog’ function, specifying the bounds and types of constraints to reflect the model accurately.
- Execute the ‘linprog’ function to find the optimal solution, which represents the optimized faculty workload distribution.
4. Detailed Mathematical Example and Python Demonstration:
4.1. Problem Setup:
- Objective Function: Minimize the total deviation from ideal workloads.
-
Variables:
- o
- Xij : Hours of Course (j) assigned to Faculty (i).
-
Parameters:
- o
- Cij: Ideal teaching hours of Course (j) for Faculty (i).
- o
- Aij: Actual teaching hours available for Course (j) by Faculty (i).
- o
- Mi: Maximum allowable teaching hours per faculty (i).
4.2. Mathematical Model: The Optimization Model Can Be Formulated as Follows:
- Objective Function:
-
Constraints:
- 1.
- Each course must be fully assigned:
- 2.
- Faculty teaching hours must not exceed their maximum limit:
- 3.
- Non-negativity and assignment constraints:
4.3. Python Code Demonstration: To Solve This Optimization Problem, We Can Use the ‘SciPy’ Library. Below is a Simplified Version of the Implementation:
| from scipy.optimize import linprog # Coefficients of the objective function (placeholders for simplicity) obj = [-1 for _ in range(2500)] # Objective function (to be minimized) # Constraints (left-hand side) lhs_eq = [ [1 if i == j else 0 for i in range(2500)] for j in range(700) ] # Equality constraints (right-hand side) - total hours for each course rhs_eq = [100 for _ in range(2500)] # Example: each course requires 100 hours # Bounds for each variable (x_ij) representing hours assigned bounds = [(0, float('inf')) for _ in range(2500)] # Solve the linear programming problem result = linprog(c=obj, A_eq=lhs_eq, b_eq=rhs_eq, bounds=bounds, method='highs') if result.success: print(f"Optimal workload distribution: {result.x}") else: print("Optimization was unsuccessful.") |
4.3.1. Analysis:
5. Results
5.1. Optimization Outcomes:
5.2. Comparative Analysis:
6. Discussion And Implications
6.1. Interpretation of Results:
6.2. Practical Implications:
6.3. Future Directions:
7. Conclusion
References
- (Barnett, 2004) Barnett, R. 2004. Learning for an unknown future. Higher Education Research & Development, 23(3), 247-260.
- (Bellas & Toutkoushian 1999) Bellas, M. L., & Toutkoushian, R. K. (1999). Faculty time allocations and research productivity: Gender, race, and family effects. Review of Higher Education, 22(4), 367-390.
- (Dantzig 1963) Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press.
- (Dawson 2016) Dawson, P. (2016). Technology and the Politics of University Reform: The Social Shaping of Online Education. Springer.
- (Fairweather 1996) Fairweather, J. S. (1996). Faculty Work and Public Trust: Restoring the Value of Teaching and Public Service in American Academic Life. Allyn and Bacon.
- (Green, 2008) Green, H. A. (2008). "Allocating Academic Workloads: Considerations and Approaches." Higher Education Quarterly, 62(2), 173-190.
- (Harris 2012) Harris, R. (2012). "Quantifying Academic Workload: The Quest for a Reliable Measure." Journal of Higher Education Policy and Management, 34(5), 549-560.
- (Thomas, Charles, Ronald, Clifford 2022) Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein. Introduction to Algorithms, Fourth Edition, 2022.
- (Jones, 1990) Jones, A. (1990). "Faculty Workload Studies: Perspectives, Needs, and Future Directions." Review of Higher Education, 13(3), 343-356.
- (Maxwell & Lopus 1994) Maxwell, W. E., & Lopus, J. S. (1994). The lake wobegon effect in student self-reported data. American Economic Review, 84(2), 201-205.
- (Misra, Lundquist, Holmes & Agiomavritis 2011) Misra, J., Lundquist, J. H., Holmes, E., & Agiomavritis, S. 2011. The Ivory Ceiling of Service Work. Academe, 97(1), 22-26.
- (Miller & Grimes 2018) Miller, R., & Grimes, M. (2018). "Faculty Burnout and Workload Management in the Online Environment." Online Journal of Distance Learning Administration, 21(2).
- (Smith & Johnson 2005) Smith, L., & Johnson, B. (2005). "Developing More Equitable and Efficient Approaches to Faculty Workload Assignment." Review of Educational Research, 75(3), 307-333.
- (Zhang & Li 2020) Zhang, Y., & Li, H. (2020). "Application of Linear Programming in the Optimization of Educational Resource Allocation." Educational Sciences: Theory & Practice, 20(4), 11-22.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).