Skip to main content
SpringerLink
Log in

Complex scheduling network: an objective performance testing platform for evaluating vital nodes identification algorithms

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

With the widespread application of complex network theory, identifying vital nodes is an important part of complex network analysis, which has been a key issue in analyzing the characteristics of network structure and functions. Although many centrality measures have been proposed to identify vital nodes, there is still a lack of an objective performance testing platform for evaluating vital nodes identification algorithms. This study introduces the complex scheduling network as an objective performance testing platform where the identification of vital nodes directly determines the decision-making in each decision scenario through the development of heuristic algorithms upon centrality measures, and therefore, the optimization goals of scheduling problems can be regarded as an objective index for evaluating vital node identification algorithms. Finally, the undirected network obtained by the open shop scheduling problem is taken as an example to analyze and evaluate the performance of various vital node identification algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Hu P, Fan W, Mei S (2015) Identifying node importance in complex networks. Phys A 429:169–176

    Article  Google Scholar 

  2. Lü L, Chen D, Ren XL, Zhang QM, Zhang YC, Zhou T (2016) Vital nodes identification in complex networks. Phys Rep 650:1–63

    Article  MathSciNet  Google Scholar 

  3. Liu Q, Zhu YX, Jia Y, Deng L, Zhou B, Zhu JX, Zou P (2018) Leveraging local h-index to identify and rank influential spreaders in networks. Phys A 512:379–391

    Article  Google Scholar 

  4. Yang R, Wang BH, Ren J, Bai WJ, Shi ZW, Wang WX, Zhou T (2007) Epidemic spreading on heterogeneous networks with identical infectivity. Phys Lett A 364(3–4):189–193

    Article  MATH  Google Scholar 

  5. Albert R, Albert I, Nakarado GL (2004) Structural vulnerability of the north American power grid. Phys Rev E 69(2):025103

    Article  Google Scholar 

  6. Lü L, Medo M, Yeung CH, Zhang YC, Zhang ZK, Zhou T (2012) Recommender systems. Phys Rep 519(1):1–49

    Article  Google Scholar 

  7. Hu P, Mei T (2018) Ranking influential nodes in complex networks with structural holes. Phys A 490:624–631

    Article  Google Scholar 

  8. Yang Y, Yu L, Wang X, Zhou Z, Chen Y, Kou T (2019) A novel method to evaluate node importance in complex networks. Phys A 526:121118

    Article  Google Scholar 

  9. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82

    Article  Google Scholar 

  10. Bian T, Hu J, Deng Y (2017) Identifying influential nodes in complex networks based on AHP. Phys A 479:422–436

    Article  MathSciNet  Google Scholar 

  11. Zareie A, Sheikhahmadi A, Fatemi A (2017) Influential nodes ranking in complex networks: an entropy-based approach. Chaos, Solitons Fractals 104:485–494

    Article  MATH  Google Scholar 

  12. Zhu C, Wang X, Zhu L (2017) A novel method of evaluating key nodes in complex networks. Chaos, Solitons Fractals 96:43–50

    Article  MATH  Google Scholar 

  13. Wen X, Tu C, Wu M, Jiang X (2018) Fast ranking nodes importance in complex networks based on LS-SVM method. Phys A 506:11–23

    Article  Google Scholar 

  14. Zareie A, Sheikhahmadi A, Jalili M (2019) Influential node ranking in social networks based on neighborhood diversity. Future Gener Comp Syst 94:120–129

    Article  Google Scholar 

  15. Salavati C, Abdollahpouri A, Manbari Z (2018) BridgeRank: a novel fast centrality measure based on local structure of the network. Phys A 496:635–653

    Article  Google Scholar 

  16. Batallas DA, Yassine AA (2006) Information leaders in product development organizational networks: social network analysis of the design structure matrix. IEEE Trans Eng Manag 53(4):570–582

    Article  Google Scholar 

  17. Ye X, Thevenot JH, Alizon F, Gershenson JK, Khadke K, Simpson TW, Shooter SB (2009) Using product family evaluation graphs in product family design. Int J Prod Res 47(13):3559–3585

    Article  MATH  Google Scholar 

  18. Cheng H, Chu X (2012) A network-based assessment approach for change impacts on complex product. J Intell Manuf 23(4):1419–1431

    Article  Google Scholar 

  19. Xuan Q, Wu TJ (2011) Network model and heuristic scheduling rule designing method for complex open shop problems. J Zhejiang Univ-SCI A 45(6):961–968

    MathSciNet  Google Scholar 

  20. Xuan Q, Wu TJ (2011) Open shop complex scheduling network model and characteristic analysis. J Zhejiang Univ-SCI A 45(4):589–595

    Google Scholar 

  21. Wang J, Hou X, Li K, Ding Y (2017) A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks. Phys A 475:88–105

    Article  Google Scholar 

  22. Chen D, Lü L, Shang MS, Zhang YC, Zhou T (2012) Identifying influential nodes in complex networks. Phys A 391(4):1777–1787

    Article  Google Scholar 

  23. Wu T, Xian X, Zhong L, Xiong X, Stanley HE (2018) Power iteration ranking via hybrid diffusion for vital nodes identification. Phys A 506:802–815

    Article  Google Scholar 

  24. Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer

  25. Azadeh A, Goldansaz S, Zahedi-Anaraki A (2016) Solving and optimizing a bi-objective open shop scheduling problem by a modified genetic algorithm. Int J Adv Manuf Technol 85(5–8):1603–1613

    Article  Google Scholar 

  26. Abreu LR, Cunha JO, Prata BA, Framinan JM (2019) A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput Oper Res 113:104793

    Article  MathSciNet  MATH  Google Scholar 

  27. Gonzalez T, Sahni S (1976) Open-shop scheduling to minimize finish time. J ACM 23(4):665–679

    Article  MathSciNet  MATH  Google Scholar 

  28. Ciro GC, Dugardin F, Yalaoui F, Kelly R (2016) Open shop scheduling problem with a multi-skills resource constraint: a genetic algorithm and an ant colony optimisation approach. Int J Prod Res 54(16):4854–4881

    Article  Google Scholar 

  29. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  30. Ahmadizar F, Farahani MH (2012) A novel hybrid genetic algorithm for the open shop scheduling problem. Int J Adv Manuf Technol 62(5–8):775–787

    Article  Google Scholar 

  31. Zhang H, Roy U (2019) A semantics-based dispatching rule selection approach for job shop scheduling. J Intell Manuf 30(7):2759–2779

    Article  Google Scholar 

  32. Zhuang Z, Lu Z, Huang Z, Liu C, Qin W (2019) A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. Math Biosci Eng 16(5):4491–4505

    Article  Google Scholar 

  33. Zhuang Z, Lu Z, Qin W (2018) A heuristic rule based dynamic open shop scheduling approach using complex network. In Proceedings of International Conference on Computers and Industrial Engineering 1-10

  34. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MathSciNet  MATH  Google Scholar 

  35. Brucker P, Hurink J, Jurisch B, Wöstmann B (1997) A branch & bound algorithm for the open-shop problem. Discret Appl Math 76(1–3):43–59

    Article  MathSciNet  MATH  Google Scholar 

  36. Guéret C, Prins C (1999) A new lower bound for the open-shop problem. Ann Oper Res 92:165–183

    Article  MathSciNet  MATH  Google Scholar 

  37. Naderi B, Zandieh M (2014) Modeling and scheduling no-wait open shop problems. Int J Prod Econ 158:256–266

    Article  Google Scholar 

  38. Clauset A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661–703

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

This study was financially supported by the National Natural Science Foundation of China (No. 51775348, No. U1637211).

Author information

Authors and Affiliations

  1. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, China

    Zilong Zhuang, Yu Chen, Yanning Sun & Wei Qin

Authors
  1. Zilong Zhuang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanning Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Qin.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhuang, Z., Chen, Y., Sun, Y. et al. Complex scheduling network: an objective performance testing platform for evaluating vital nodes identification algorithms. Int J Adv Manuf Technol 111, 273–282 (2020). https://doi.org/10.1007/s00170-020-06145-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-020-06145-5

Keywords

Search

Navigation