检索结果-南通市图书馆

第二十九届中国控制会议

作者： GAO Kaizhou,PAN Quanke,ZUO Fengchao,DUAN Junhua School of computer science,Liaocheng University,Liaocheng 252059,P.R.China

This paper proposes an effective method for the no-wait flow-shop scheduling optimization based on harmony search（HS）.flow-shop scheduling problem（FSSP）is a typical NP-hard combinational *** purpose of this paper is the total flow time ***,the HS-based optimization mechanism and framework is ***,the total flow time is calculated by a novel ***,a largest-order-value rule is used to transform harmony in harmony memory from real vectors to job sequence so that the harmony search can be applied for *** rule of new harmony is expatiated and high effective algorithm parameters are set for optimization *** last,simulations and comparisons demonstrate the efficiency,effectiveness and robustness of harmony search algorithm for no-wait FSSP.

关键词： Harmony Search Optimization no-wait flow shop Scheduling

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Evolved Discrete Harmony Search Algorithm for Multi-objective no-wait flow shop Scheduling Problem

Evolved Discrete Harmony Search Algorithm for Multi-objectiv...

引用

2012年计算机应用与系统建模国际会议

作者： Xie Guang Li Junqing Hainan University Sanya College School of Computer Science Liaocheng University

In this paper, an evolved discrete harmony search (EDHS) is proposed. Firstly, a job-permutation-based encoding scheme is applied to enable the continuous harmony search algorithm to be used in all sequencing problems. Additional, a new method is proposed to generate new solutions, while an efficient approach is developed to update the archive set of the non-dominated solutions during the search process. Finally, computational simulation results based on the well-known benchmarks show that the proposed EDHS algorithm is superior to hybrid differential evolution algorithm in terms of searching quality, diversity level and efficiency.

关键词： Harmony search no-wait flow shop Multi-object optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime

引用

Journal of Southeast University(English Edition) 2008年第4期24卷 450-454页

作者：廖小平刘有根李小平河海大学计算机及信息工程学院南京210098 东南大学计算机科学与工程学院南京210096

The NP-hard no-wait flow shop scheduling problems with makespan and total flowtime minimization are considered. Objective increment properties of the problems are analyzed. A non-dominated classification method is introduced to class population individuals into Pareto fronts to improve searching efficiency. Besides investigating the crowding distance and the elitist solution strategy, two effective bi-criteria local search procedures based on objective increments are presented to improve searching effectiveness. Based on the properties and methods, a hybrid evolutionary algorithm is proposed for the considered problems and compared with the best existing algorithms. Experimental results show that the proposed algorithm is effective with high efficiency.

关键词： no-wait flow shop objective increment makespan total flowtime evolutionary algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：