A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.展开更多
In this work,we study the convergence of evolving Finslerian metrics first in a general flow and next under Finslerian Ricci flow.More intuitively it is proved that a family of Finslerian metrics g（t）which are solut...In this work,we study the convergence of evolving Finslerian metrics first in a general flow and next under Finslerian Ricci flow.More intuitively it is proved that a family of Finslerian metrics g（t）which are solutions to the Finslerian Ricci flow converges in C~∞ to a smooth limit Finslerian metric as t approaches the finite time T.As a consequence of this result one can show that in a compact Finsler manifold the curvature tensor along the Ricci flow blows up in a short time.展开更多
基金Supported by the National Natural Science Foundation of China (61174040, 61104178)the Fundamental Research Funds for the Central Universities
文摘A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
文摘In this work,we study the convergence of evolving Finslerian metrics first in a general flow and next under Finslerian Ricci flow.More intuitively it is proved that a family of Finslerian metrics g（t）which are solutions to the Finslerian Ricci flow converges in C~∞ to a smooth limit Finslerian metric as t approaches the finite time T.As a consequence of this result one can show that in a compact Finsler manifold the curvature tensor along the Ricci flow blows up in a short time.
