Toward Automatic Scheduling Algorithm with Hash-Based Priority Selection Strategy

  • Xiaonan Ji
  • Kun MaEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1057)


 Not only the organizations or groups but also the laboratory or the store is in demand of a system with automatic scheduling algorithm. Current automatic scheduling with computer is time consuming. With the goal to develop an innovative system which can increase the productivity, we finally design an advanced algorithm based on priority and hash map. It firstly provides a method called linear programming (LP) for the problem. Then, we interpret the similar backtracking approaches and compared with another two algorithms. We rebuild their process and design and propose a more efficient and simpler algorithm based on priority and hash. After the development of such a web system, it is proved to be a simple, efficient, and easy-implement method to solve the problem.


Scheduling algorithm Duty table Priority selection strategy Duty management 



This work was supported by the National Natural Science Foundation of China (61772231), the Shandong Provincial Natural Science Foundation (ZR2017MF025), the Shandong Provincial Key R&D Program of China (2018CXGC0706), the Project of Shandong Province Higher Educational Science and Technology Program (J16LN13), the Science and Technology Program of University of Jinan (XKY1734 & XKY1828), and the Project of Shandong Provincial Social Science Program (18CHLJ39).


  1. 1.
    Chen, W., Chen, K., Cheng, J.C., Wang, Q., Gan, V.J.: Bim-based framework for automatic scheduling of facility maintenance work orders. Autom. Constr. 91, 15–30 (2018)CrossRefGoogle Scholar
  2. 2.
    Ma, K., Yang, B., Yu, Z.: Optimization of stream-based live data migration strategy in the cloud. Concurrency Comput. Practice Experience 30(12), e4293 (2018)CrossRefGoogle Scholar
  3. 3.
    Wang, J.A., Pan, R., Gao, W., Wang, H.: An automatic scheduling method for weaving enterprises based on genetic algorithm. J. Textile Inst. 106(12), 1377–1387 (2015)CrossRefGoogle Scholar
  4. 4.
    Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (2016)Google Scholar
  5. 5.
    Zhang, Y., Sun, X., Wang, B.: Efficient algorithm for k-barrier coverage based on integer linear programming. China Commun. 13(7), 16–23 (2016)CrossRefGoogle Scholar
  6. 6.
    Geem, Z.W.: Harmony search algorithm for solving sudoku. In: International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, pp. 371–378. Springer, Berlin (2007)Google Scholar
  7. 7.
    Patterson, J.H., Brian Talbot, F., Slowinski, R., Weglarz, J.: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (1990)Google Scholar
  8. 8.
    Chaib, A., Bouchekara, H., Mehasni, R., Abido, M.: Optimal power flow with emission and non-smooth cost functions using backtracking search optimization algorithm. Int. J. Electr. Power Energy Syst. 81, 64–77 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Shandong Provincial Key Laboratory of Network Based Intelligent ComputingUniversity of JinanJinanChina

Personalised recommendations