检索结果-内蒙古大学图书馆

A new triangular fuzzy johnson algorithm

COMPUTERS & INDUSTRIAL ENGINEERING 1999年第1期36卷 179-200页

作者： Hong, TP Chuang, TN I Shou Univ Dept Informat Management Kaohsiung 84008 Taiwan I Shou Univ Inst Management Sci Kaohsiung 84008 Taiwan

Scheduling consists mainly of allocating resources to jobs over time under necessary constraints. In the past, the processing time for each job was usually assigned or estimated as a fixed value. In many real-world applications, however, job processing times may vary dynamically. McCahon and Lee proposed a fuzzy johnson algorithm for managing uncertain scheduling. However, some problems exist in their procedure with respect to calculation of the starting time for each job. In this paper, we modify McCahon and Lee's algorithm and propose a new reasonable procedure for eliminating start-time uncertainties. A half-inverse operator is defined and 24 cases are analyzed to verify this procedure. Analytical and experimental results showing the effectiveness of our method are also presented. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： completion time fuzzy ranking fuzzy task johnson algorithm scheduling

来源：评论

学校读者我要写书评

暂无评论

Fuzzy flexible flow shops at two machine centers for continuous fuzzy domains

引用

INFORMATION SCIENCES 2000年第1-4期129卷 227-237页

作者： Hong, TP Wang, TT I Shou Univ Dept Informat Management Kaohsiung 84008 Taiwan I Shou Univ Inst Informat Engn Kaohsiung 84008 Taiwan

Flexible flow shops can be thought of as generalizations of simple flow shops. In the past, the processing time for each job was usually assumed to be known exactly, but in many real-world applications, processing times may vary dynamically due to human factors or operating faults. In T.P. Hong, W.C. Chen [Journal of Advanced Computing Intelligence 2 (4) (1998) 142-149], we have demonstrated how discrete fuzzy concepts could easily be used in the Sriskandarajah and Sethi's algorithm for managing uncertain flexible-flow-shop scheduling. In this paper, we generalize it to continuous fuzzy domains. We use triangular membership functions for flexible flow shops with two machine centers to examine processing-time uncertainties and to make scheduling more suitable for real applications. We first use triangular fuzzy LPT algorithm to allocate jobs, and then use triangular fuzzy johnson algorithm to deal with sequencing the tasks. The proposed method thus provides a more flexible way of scheduling jobs than conventional scheduling methods. (C) 2000 Elsevier Science Inc. All rights reserved.

关键词： scheduling flexible flow shop fuzzy set membership function LPT johnson algorithm

来源：评论

学校读者我要写书评

暂无评论

The Frobenius problem for classes of polynomial solvability

引用

MATHEMATICAL NOTES 2001年第5-6期70卷 771-778页

作者： Kan, ID Moscow MV Lomonosov State Univ Moscow 117234 Russia

The Frobenius problem is to find a method (= algorithm) for calculating the largest "sum of money" that cannot be given by coins whose values b(0), b(1),..., b(w). are coprime integers. As admissible solutions (algorithms), it is common practice to study polynomial algorithms, which owe their name to the form of the dependence of time expenditure on the length of the original information. The difficulty of the Frobenius problem is apparent from the fact that already for w = 3 the existence of a polynomial solution is still an open problem. In the present paper, we distinguish some classes of input data for which the problem can be solved polynomially;nevertheless, argumentation in the spirit of complexity theory of algorithms is kept to a minimum.

关键词： Frobenius problem coprime integers polynomial algorithm johnson algorithm Rodset algorithm

来源：评论

学校读者我要写书评

暂无评论

Frobenius problem for three arguments

引用

MATHEMATICAL NOTES 1997年第3-4期62卷 521-523页

作者： Kan, ID Stechkin, BS Sharkov, IV Russian Acad Sci Inst Math Moscow V71 Russia

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Discernibility Matrix Based Reduct Computation Techniques

Evaluation of Discernibility Matrix Based Reduct Computation...

引用

5th International Conference on Computer Science and Information Technology (CSIT)

作者： AliKhashashneh, Enas A. Al-Radaideh, Qasem A. Fac Informat Technol Dept Comp Informat Syst Irbid 21163 Jordan

ISBN: (纸本)9781467358255

Rough set theory provides some principles that are used for data classification and knowledge reduction. Reduct is one of the main concepts that can be used for feature set reduction and for data classification. Finding the reduct set is computationally expensive for data sets with large number of attributes. Several heuristic approached have been proposed to extract reduct sets where some of the approached used the Discernibility Matrix (DM) concept to perform the reduct computation. In this paper the johnson reduction algorithm and the Object Reduct using Attribute Weighting technique algorithm (ORAW) for reduct computation are evaluated. The two approaches aim at reducing the number of features in the dataset. To evaluate the two approaches several UCI standard datasets were used in the experiments. The results of the experiments showed that the ORAW approach gives better results in term of classification accuracy where the average classification accuracy over eight data sets achieved by the ORAW approach was 85.6%;while johnson approach achieved 78.8% of accuracy. For further evaluation, the two approaches were compared with some other well known classification techniques.

关键词： Data Mining Data Preprocessing Rough Set johnson algorithm Discernibility Matrix (DM) ORAW Reduct Set Rosetta tool

来源：评论

学校读者我要写书评

暂无评论

Studying Two-Stage Vehicle Scheduling at Distribution Center Based on Cross-Docking Model

Studying Two-Stage Vehicle Scheduling at Distribution Center...

引用

3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI)

作者： Gao, Jing Gao, Ju-hong Tianjin Univ Dept Management & Econ Tianjin 300072 Peoples R China

ISBN: (纸本)9783642330124

The reasonable arrangement of the time of inbound trucks' arrival at the distribute center was very important to ensure the smooth circulation of goods and cost reduction. The course of unloading and sorting were regarded as two stage flow shop in the Cross-docking (CD) environment including only one door and one conveyor, applying the johnson algorithm to solve the problem of minimizing working hour of goods (work piece). Finally, according to a distribution center' order data, the minimum time required for sorting all the batch of goods was calculated, and the optimum sequence of inbound trucks was obtained, which can provide guidance for CD practice.

关键词： Cross-docking johnson algorithm Sorting Two-stage Flow Shop Vehicle Scheduling

来源：评论

学校读者我要写书评

暂无评论

Retiming Technique for Clock Period Minimization using Shortest Path algorithm

Retiming Technique for Clock Period Minimization using Short...

引用

IEEE International Conference on Computing, Communication and Automation (ICCCA)

作者： Pandey, Vinita Yadav, S. C. Arora, Priya Graph Era Univ Dehradun ECE Dept Dehra Dun Uttar Pradesh India Graph Era Univ Dehradun CS Dept Dehra Dun Uttar Pradesh India

ISBN: (纸本)9781509016662

VLSI technology requires three main factors high speed, less power and small chip area. Speed is the factor which always depends upon clock frequency. Computation time of digital circuit can be reduced by applying transformation of delay that is retiming to digital signal block, which can be applied to digital signal processing blocks that can reduce computation time. For transformation ofdelay we need critical path and shortest path computation algorithm. Clock period minimization techniques of retiming used to minimize clock period of the circuit like Infinite impulse response, Finite impulse respons (IIR, FIR) filters. We have computed critical path before applying retiming in circuit, it gives us an estimation of computing time. Shortest path algorithms are required in the circuit for solving shortest path problem in the graph. We are explaining clock period minimization technique of retiming to enhance speed and proposing new shortest path algorithm. Existing method contain Floyd-Warshall(all pair shortest path) and Bellman Ford algorithms (single point shortest path) which are used in retiming. We are giving new Dijkstra algorithm(single point shortest path algorithm) instead of bellman ford algorithm because it has less run time complexity and high speed. We also observed that most of filter data flow graph are sparse. Then we have chosen johnson algorithm (all pair shortest path) because run time complexity of it is less than Floyd-Warshall which are existing algorithm. For this purpose used CAD tool for computing run time complexity of overall algorithm.

关键词： Critical-path Data flow graph(DFG) BellmanFord algorithm Floyd-Washall algorithm johnson algorithm Dijkstra algorithm greedy strategy Sparse graph

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Fault Tolerant MapReduce Framework for Minimizing Makespan in Hybrid Cloud Environment

A Heuristic Fault Tolerant MapReduce Framework for Minimizin...

引用

International Conference on Green Computing Communication and Electrical Engineering (ICGCCEE)

作者： Raju, R. Amudhavel, J. Pavithra, M. Anuja, S. Abinaya, B. Bharathiyar Univ Coimbatore Tamil Nadu India Pondicherry Univ Pondicherry India SMVEC Pondicherry India

ISBN: (纸本)9781479949816

Cloud Computing propounds a striking option for business to pay only for the resources that were consumed. The prime challenge is to increase the MapReduce clusters to minimize their costs. MapReduce is a widely used parallel computing framework for large scale data processing. The major concern of map reduce programming model are job execution time and cluster throughput. Multiple speculative execution strategies have been proposed, but all are failed to address the DAG communication and cluster utilization. In this paper, we developed a new strategy, OTA (Optimal Time algorithm), which improves the effectiveness of speculative execution significantly. OTA do not consider the difference between the execution time of tasks on the same processors, they may form clusters of tasks that are not similar to each other. The proposed strategy efficiently utilizes the characteristics and properties of the MapReduce jobs in the given workload for constructing optimal job schedule. This resolves the problem of minimizing the makespan of workloads that additionally includes the workflow (DAGs) of mapreduce jobs.

关键词： Cloud Computing Hadoop MapReduce Makespan MPT johnson algorithm DAG

来源：评论

学校读者我要写书评

暂无评论

Retiming Technique for Clock Period Minimization using Shortest Path algorithm

Retiming Technique for Clock Period Minimization using Short...

引用

International Conference on Computing, Communication and Automation

作者： Vinita Pandey S.C. Yadav Priya Arora ECE Deptt. Graphic Era University Dehradun India CS Deptt. Graphic Era University Dehradun India

ISBN: (纸本)9781509016679

VLSI technology requires three main factors high speed, less power and small chip area. Speed is the factor which always depends upon clock frequency. Computation time of digital circuit can be reduced by applying transformation of delay that is retiming to digital signal block, which can be applied to digital signal processing blocks that can reduce computation time. For transformation ofdelay we need critical path and shortest path computation algorithm. Clock period minimization techniques of retiming used to minimize clock period of the circuit like Infinite impulse response,Finite impulse respons (IIR,FIR) filters. We have computed critical path before applying retiming in circuit, it gives us an estimation of computing time. Shortest path algorithms are required in the circuit for solving shortest path problem in the graph. We are explaining clock period minimization technique of retiming to enhance speed and proposing new shortest path algorithm. Existing method contain Floyd-Warshall(all pair shortest path) and Bellman Ford algorithms (single point shortest path)which are used in retiming .We are giving new Dijkstra algorithm(single point shortest path algorithm)instead of bellman ford algorithm because it has less run time complexity and high speed. We also observed that most of filter data flow graph are sparse. Then we have chosen johnson algorithm (all pair shortest path) because run time complexity of it is less than Floyd-Warshall which are existing algorithm. For this purpose used CAD tool for computing run time complexity of overall algorithm.

关键词： Critical-path Data flow graph(DFG) Bellman-Ford algorithm Floyd-Washall algorithm johnson algorithm Dijkstra algorithm greedy strategy Sparse graph

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Discernibility Matrix Based Reduct Computation Techniques

Evaluation of Discernibility Matrix Based Reduct Computation...

引用

International Conference on Computer Science and Information Technology

作者： Enas A. AliKhashashneh Qasem A. Al-Radaideh Department of Computer Information Systems Faculty of Information Technology Irbid 21163 Jordan

ISBN: (纸本)9781467356107

关键词： Data Mining Data Preprocessing Rough Set johnson algorithm Discernibility Matrix (DM) ORAW Reduct Set Rosetta tool. Data preprocessing Rough sets data mining Dataset data classification arithmetic Rough set theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：