European Journal of Operational ResearchNg, S.M., Worst-case analysis of an algorithm for cellular manufacturing. Eur. J. Oper. Res., 1993, 69, 384-398.Ng, S. (1993). Worst-case analysis of an algorithm for cellular manufacturing. European Journal of Operational Research, 69(3), 384-...
We also derive a similar bound for the preemptive version of the Brucker–Garey–Johnson algorithm.doi:10.1016/S0969-6016(00)00023-XG SinghY ZinderElsevier ScienceInternational Transactions in Operational ResearchSingh, G. and Zinder, Y. (2000b). Worst-case performance of critical path type ...
网络最坏情况渐近分析法 网络释义 1. 最坏情况渐近分析法 他提出了一种称为“最坏情况渐近分析法”(Worst-case asymptotic analysis of algorithm),成为衡量算法的效率和优劣的数学准则… www.baike.com|基于16个网页
Two measures for the efficiency of grouping in cellular manufacturing are discussed in this paper. We first analyze the effectiveness of the first measure, grouping efficiency. A worst case bound is then derived for the minimum spanning tree algorithm with respect to this measure. We then show a...
In this paper, the worst-case analysis of the time and space complexity of the parameter-less genetic algorithm versus the genetic algorithm with an optimal population size is provided and the results of the analysis are discussed. Since... M Pelikan,O Lobo - Genetic & Evolutionary Computation...
Chen, Glass, Potts, and Strusevich presented a heuristic algorithm, which has a worst-case performance ratio of 5/3 for the three-machine flow shop scheduling (3FSS) problem. They provided a worst-case instance of 3FSS with seven jobs to show the tightness of this bound. In this paper,...
最坏情况分析,worst case analysis 1)worst case analysis最坏情况分析 1.The theories of Monte Carlo analysis and worst case analysis are described.介绍了可靠性设计的基本技术之一的容差分析的意义及整体流程,详细论述了蒙特卡罗分析和最坏情况分析的基本原理,提出了基于软件应用仿真方法进行电路容差分析的方案,...
Evaluates the performance of the critical path method. Use of the worstcase analysis of Hu's algorithm and the Brucker-Garey-Johnson algorithm in the char... Singh,Gaurav,Zinder,... - Asia-Pacific Journal of Operational Research 被引量: 0发表: 2000年 Performance of critical path type algor...
Segment Abstraction for Worst-Case Execution Time AnalysisSummary: In the standard framework for worst-case execution time (WCET) analysis of programs, the main data structure is a single instance of integer linear programming (ILP) that represents the whole program. The instance of this NP-hard ...
This is irrespective of the individual priority level of each frame. Recently, a multi-level preemption scheme has been proposed to circumvent these limitations. The work focused on the feasibility and implementation requirement of such an approach, but a formal analysis of the worst-case ...