This paper applies data envelopment analysis (DEA) and stochastic frontier analysis (SFA) to explore the relative efficiency of China's research universities of science and technology. According to ...the finding, when talent training is the only output, the efficiency of research universities of science and technology is far lower than that of comprehensive universities. However, when the outputs of scientific research and social service are taken into consideration, the former will increase remarkably and even exceeds the latter. Moreover, the research universities of science and technology have a higher inner homogeneity because their standard deviation of efficiency score is obviously lower. The study also reveals that the number of research universities of science and technology with redundant inputs is more than that of comprehensive universities. Beyond that, the environmental variables and statistical noise exert no significant effect on the efficiency of Chinese research universities.
The research on complex workshop scheduling methods has important academic significance and has wide applications in industrial manufacturing. Aiming at the job shop scheduling problem, a hybrid ...algorithm based on comprehensive search mechanisms (HACSM) is proposed to optimize the maximum completion time. HACSM combines three search methods with different optimization scales, including fireworks algorithm (FW), extended Akers graphical method (LS1+_AKERS_EXT), and tabu search algorithm (TS). FW realizes global search through information interaction and resource allocation, ensuring the diversity of the population. LS1+_AKERS_EXT realizes compound movement with Akers graphical method, so it has advanced global and local search capabilities. In LS1+_AKERS_EXT, the shortest path is the core of the algorithm, which directly affects the encoding and decoding of scheduling. In order to find the shortest path, an effective node expansion method is designed to improve the node expansion efficiency. In the part of centralized search, TS based on the neighborhood structure is used. Finally, the effectiveness and superiority of HACSM are verified by testing the relevant instances in the literature.
Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm ...to solve JSP, which first removes part of jobs from the original schedule, then constructs obstacle graph and finds the shortest path from the graph, and finally reinserts the jobs according to the shortest path decoding method to get the new schedule. Although the new scheduling can achieve good results, it is time‐consuming to find the shortest path. Therefore, it is necessary to further study how to quickly plan the shortest path. This study presents a fast layered path search algorithm for solving the obstacle graph of job shop scheduling. The algorithm designs a node expansion method and a delay distance formula. The obstacles generated by different machines in the obstacle graph are layered. When the nodes expand, the extended nodes are compared with the parent layer nodes to quickly avoid closely arranged obstacles, and multiple child nodes are generated at one time through node expansion to improve the node expansion ability. At the same time, node expansion method and delay distance formula can be well integrated with A* algorithm. Finally, the test verifies that the algorithm can spend less time to find the shortest path.
With the makespan as the optimisation goal, we propose a hybrid solving method that combines improved extended shifting bottleneck procedure (i-ESB) and genetic algorithm (GA) for the assembly job ...shop scheduling problem (AJSSP). Hybrid genetic algorithm (HGA) uses a GA based on operation constraint chain coding to achieve global search and a local search based on an i-ESB. In the design of i-ESB, an extended disjunctive graph model (EDG) corresponding to AJSSP is presented. The calculation method of the operation head and tail length based on EDG is studied, as well as the searching method of key operations. The Schrage algorithm with disturbance is used to solve the single-machine scheduling subproblem. The selection criterion for bottleneck machines is increased. A greedy bottleneck machine re-optimisation process is designed. The effectiveness and superiority of the proposed algorithm are verified by testing and analysing the relevant examples in the literature.
A novel series of 2-cyclopropyl-4-thiophenyl quinoline-based mevalonolactones were synthesized from the substituted anilines by several reactions. Among them, (4
R,6
S)-6-(
...E)-2-(2-cyclopropyl-6-fluoro-4-(4-fluoro-thiophenyl)-quinoline-3-yl)-ethenyl-3,4,5,6-tetrahydro-4-hydroxy-2
H-pyran-2-one (
1d), (4
R,6
S)-6-(
E)-2-(2-cyclopropyl-6-fluoro-4-(3-methoxy-thiophenyl)-quinoline-3-yl)-ethenyl-3,4,5,6-tetrahydro-4-hydroxy-2
H-pyran-2-one (
1f) and (4
R,6
S)-6-(
E)-2-(2-cyclopropyl-6-fluoro-4,7-di(3-methoxy-thiophenyl)-quinoline-3-yl)-ethenyl-3,4,5,6-tetrahydro-4-hydroxy-2
H-pyran-2-one (
1q) showed potent HMG-CoA reductase inhibitory activity comparable with pitavastatin.
In this article, the input-output efficiencies of China research universities from 2000-2015 was analysed based on SBM of Super-Efficiency DEA model and Global Malmquist Index. Results show that the ...mean score of efficiencies during the 15 years is generally on a continuous increasing trend, featuring scale expansion and structure optimization of output. To be specific, comprehensive universities and universities of science and technology show similar trends: the efficiency score increases significantly from 2000 to 2005, while the increasing rate is slightly lowered from 2010 to 2015; the efficiency score of universities of humanities and social science is the lowest among the three types of universities, however, its efficiency score is generally in increasing trend. web URL: http://www.transformations.knf.vu.lt/41b/article/anal
PDF
