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

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.

[1]  Canshi Zhu,et al.  A novel method of evaluating key nodes in complex networks , 2017 .

[2]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Tao Zhou,et al.  Epidemic spreading on heterogeneous networks with identical infectivity , 2007 .

[5]  Yong Deng,et al.  Identifying influential nodes in complex networks based on AHP , 2017 .

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  Kezan Li,et al.  A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks , 2017 .

[8]  Jose M. Framinan,et al.  A genetic algorithm for scheduling open shops with sequence-dependent setup times , 2020, Comput. Oper. Res..

[9]  Fardin Ahmadizar,et al.  A novel hybrid genetic algorithm for the open shop scheduling problem , 2012 .

[10]  Utpal Roy,et al.  A semantics-based dispatching rule selection approach for job shop scheduling , 2019, J. Intell. Manuf..

[11]  Congliang Tu,et al.  Fast ranking nodes importance in complex networks based on LS-SVM method , 2018, Physica A: Statistical Mechanics and its Applications.

[12]  Tian Kou,et al.  A novel method to evaluate node importance in complex networks , 2019, Physica A: Statistical Mechanics and its Applications.

[13]  Ping Hu,et al.  Ranking influential nodes in complex networks with structural holes , 2018 .

[14]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[15]  宣琦 吴铁军,et al.  Network model and heuristic scheduling rule designing method for complex open shop problems , 2011 .

[16]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[17]  Mahdi Jalili,et al.  Influential node ranking in social networks based on neighborhood diversity , 2019, Future Gener. Comput. Syst..

[18]  Chengliang Liu,et al.  A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates. , 2019, Mathematical biosciences and engineering : MBE.

[19]  Christelle Guéret,et al.  A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..

[20]  Ali Azadeh,et al.  Solving and optimizing a bi-objective open shop scheduling problem by a modified genetic algorithm , 2016 .

[21]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[22]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

[23]  Hui Cheng,et al.  A network-based assessment approach for change impacts on complex product , 2012, J. Intell. Manuf..

[24]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Farouk Yalaoui,et al.  Open shop scheduling problem with a multi-skills resource constraint: a genetic algorithm and an ant colony optimisation approach , 2016 .

[26]  Qiang Liu,et al.  Leveraging local h-index to identify and rank influential spreaders in networks , 2017, Physica A: Statistical Mechanics and its Applications.

[27]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[28]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[29]  T. Simpson,et al.  Using product family evaluation graphs in product family design , 2009 .

[30]  Tao Wu,et al.  Power iteration ranking via hybrid diffusion for vital nodes identification , 2018, Physica A: Statistical Mechanics and its Applications.

[31]  Shengwei Mei,et al.  Identifying node importance in complex networks , 2015 .

[32]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[33]  Mostafa Zandieh,et al.  Modeling and scheduling no-wait open shop problems , 2014 .

[34]  A. Fatemi,et al.  Influential nodes ranking in complex networks: An entropy-based approach , 2017 .

[35]  Ali A. Yassine,et al.  Information Leaders in Product Development Organizational Networks: Social Network Analysis of the Design Structure Matrix , 2006, IEEE Transactions on Engineering Management.

[36]  Alireza Abdollahpouri,et al.  BridgeRank: A novel fast centrality measure based on local structure of the network , 2017 .

[37]  Wu Tie-jun Xuan Qi.  Open shop complex scheduling network model and characteristic analysis , 2011 .