Welcome to Francis Academic Press

Academic Journal of Computing & Information Science, 2020, 3(1); doi: 10.25236/AJCIS.2020.030104.

Research on Solving Assignment Problem Based on Linear Programming Modeling

Author(s)

Zijun Zhang

Corresponding Author:
Zijun Zhang
Affiliation(s)

Shanghai Guanghua Cambridge International School, Shanghai 201315, China;
2028435326@qq.com

Abstract

The optimal allocation of resources plays an important role in improving the competitiveness of modern enterprises, but the unbalanced and uncoordinated allocation of resources still restricts the realization of the ideal state of production activities. The research of assignment problem can improve the product design and production efficiency of enterprises. In this paper, through linear programming modeling, basic transformation of matrix and Hungarian algorithm, the optimal assignment method was obtained. It provided the basis for further programming. Then, taking the time arrangement of Chinese manual translation as a basic example, the results showed that using the model and solving has a good effect, and could make the most reasonable allocation in a short time. Based on the traditional Hungarian method, this paper improved the solution of the maximum assignment problem, which makes the solution more direct. It is also of great practical significance to study the solution of optimization assignment problem to improve the efficiency of completing tasks.

Keywords

Assignment problem, linear programming, matrix transformation, optimal method

Cite This Paper

Zijun Zhang. Research on Solving Assignment Problem Based on Linear Programming Modeling. Academic Journal of Computing & Information Science (2020), Vol. 3, Issue 1: 34-38. https://doi.org/10.25236/AJCIS.2020.030104.

References

[1] Takeo Yamada, Yasushi Nasu. Heuristic and exact algorithms for the simultaneous assignment problem[J]. European Journal of Operational Research, 123(3):531-542.
[2] Takeo Yamada, Takahiro Takeoka. An exact algorithm for the fixed-charge multiple knapsack problem[J]. European Journal of Operational Research, 192(2):700-705.
[3] R. Tijdeman. The chairman assignment problem[J]. Discrete Mathematics, 32(3):323-330.
[4] Cacchiani, Valentina, Caprara, Alberto, Toth, Paolo. A Lagrangian heuristic for a train-unit assignment problem [J]. Discrete Applied Mathematics, 161(12):1707-1718.
[5] Arslanoglu Y, Toroslu I H. Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints[M]// Computer and Information Sciences II. 2012.
[6] Rosen, Sherwin. The Military as an Internal Labor Market: Some Allocation, Productivity, and Incentive Problems[J]. Social Science Quarterly, 1992, 73(2):227-237.
[7] P Ramanan, J.S Deogun, C.L Liu. A personnel assignment problem[J]. Journal of Algorithms, 5(1):132-144.
[8] Timothy T. Liang, Theodore J. Thompson. A large-scale personnel assignment model for the Navy[J]. Decision Sciences, 2007, 18(2):234-249.
[9] Bruijn de NG. The mathematical language AUTOMATH, its usage, and some of its extensions[J]. Studies in Logic & the Foundations of Mathematics, 1994, 125:73-100.
[10] Takeshi Fujiwara, Junji Nakano, Yoshikazu Yamamoto. Using mathematical expressions in a statistical language[J]. Computational Statistics & Data Analysis, 52(2):650-662.