检索结果-南通市图书馆

第40届中国控制会议

作者： Xuan He Yu-Fan Liu Quan-Ke Pan Yang Yu Yuan-Zhen Li School of Mechatronic Engineering and Automation Shanghai University International School Beijing University of Posts and Telecommunications School of Automation Shenyang Aerospace University

Due to the extensive applications of the flowshop sequence-dependent group scheduling problem（FSDGSP）, especially in the manufacturing industry, there has been a growing interest in the research of it. In this paper, a constructive heuristic called JPALRxis proposed for solving FSDGSP with Total Flow Time criterion. In the JPALRx, a sequence of part families is determined by a jigsaw puzzle inspired algorithm considering major family setup times. Afterwards, a job sequence within each part family is obtained by using a heuristic algorithm called LRx. Furthermore, an insert operator based on family is used to further improve the quality of the solution obtained. The experimental results demonstrate the effectiveness and efficiency of JPALRx.

关键词： group scheduling flow line manufacturing cells constructive heuristics Total Flow Time sequence-dependent family setup times

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Discrete Artificial Bee Colony for Distributed Permutation flowshop Scheduling Problem with Total Flow Time Minimization

A Discrete Artificial Bee Colony for Distributed Permutation...

引用

第37届中国控制会议

作者： Jia-Qi Pan Wen-Qiang Zou Jun-hua Duan Shengli No.1 Middle School School of Mechatronic Engineering and Automation Shanghai University Computer Center Shanghai University

The distributed permutation flowshop scheduling problem（DPFSP） has important applications in modern industries.This paper presents a discrete artificial bee colony（DABC） algorithm for solving the DPFSP with Total Flow Time criterion. We use the job permutation based representation to represent the candidate solutions. The insertion operator is adapted to generate neighboring solutions in the search process. We re-design the search phases including employ bees, onlooker bees, and scout bees according to the problem-specific knowledge. A comprehensive computational campaign based on the 720 benchmark instances demonstrates the effectiveness of the proposed DABC algorithm for solving the DPFSP with the total flowtime criterion.

关键词： Scheduling flowshop Artificial Bee colony Total Flow Time

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Hybrid heuristics based on harmony search to minimize Total Flow Time in no-wait flow shop

Hybrid heuristics based on harmony search to minimize total ...

引用

2010 Chinese Control and Decision Conference

作者： K.Z.Gao~1,H.Li~1,Q.K.Pan~1,J.Q.Li~1,J.J.Liang~2 1 College of Computer Science,Liaocheng University,Liaocheng,252059,PR China 2 School.Electrical Engineering,Zhengzhou University

＜正＞This paper proposes an effective harmony search（HS） based heuristics method for the no-wait flow-shop scheduling optimization.The purpose of this paper is to minimize the Total Flow Time.Firstly,the basic HS optimization mechanism,FSSP is presented and the Total Flow Time is calculated by a novel method. Secondly,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 FSSP.Improvising rule of new harmony is expatiated and high effective algorithm parameters are set for optimization object.Thirdly,HS and Insert-and interchange-based neighbor search,is proposed to solve the FSSP.At last,simulations and comparisons demonstrate the efficiency,effectiveness and robustness of harmony search algorithm for no-wait FSSP.

关键词： Harmony search Total Flow Time no-wait flow shop

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Hybrid Discrete Harmony Search Algorithm for flow Shop Scheduling with Limited Buffers

引用

Journal of Donghua University(English Edition) 2014年第2期31卷 171-178页

作者：崔喆顾幸生 Key Laboratory of Advanced Control and Optimization for Chemical Process Ministry of EducationEast China University of Scienceand Technology

The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize Total Flow Time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.

关键词： multiproduct processes scheduling problem limited buffers Total Flow Time harmony search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Approach of hybrid GA for multi-objective job-shop scheduling

引用

International Journal of Modeling, Simulation, and Scientific Computing 2016年第4期7卷 58-67页

作者： Qiaofeng Meng Linxuan Zhang Yushun Fan State CIMS Engineering Research Center at Tsinghua University Beijing 100084 P.R.China

In recent years,scholars have made many research results on job-shop scheduling(JSP)problem,especially in single objective such as the maximum completion time.But most of the actual system scheduling problems are more than one object.Therefore,the research of multi-objective scheduling problem is very important and meaningful.In this paper,we proposed a multi-objective scheduling model which adopts weighted sum method to optimize two important indexes(makespan and Total Flow Time).Genetic algorithm(GA)has diversified global search ability,while simulated annealing(SA)combined with tabu search(TS)have intensified capabilities in local neighborhood search.To overcome the drawback of the GA,we proposed a new hybrid GA(NewHGA)which produces initial solutions by GA firstly,and then take SA operator incorporate TS operator to search in the local space.By adding the novel local search strategy,the diversity of solutions will be improved greatly so that it can ensure the algorithm jump out of the local optimal value.We test this algorithm using the benchmark instances of different sizes taken from the OR-Library,and the results show that the algorithm is efficient than another hybrid algorithm.

关键词： Job shop multiple objectives weighted sum method the maximum completion time Total Flow Time

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Hybrid Tabu Search algorithm for bi-criteria No-idle permutation flow Shop Scheduling Problem

Hybrid Tabu Search algorithm for bi-criteria No-idle permuta...

引用

2011 Chinese Control and Decision Conference（CCDC）

作者： Wen-Juan REN is with the College of Computer Science,Liao Cheng University,CO 252059,China.Jun-Hua DUAN is with the College of Computer Science,Liao Cheng University,CO 252059,China.Feng-rong Zhang is with the College of Computer Science,Liao Cheng University,CO 252059,China.Hong-yan Han is with the College of Mathematic,Liao Cheng University,CO 252059,China.Min Zhang is with the College of Computer Science,Liao Cheng University,CO 252059,China.

A novel Hybrid Tabu Search Algorithm （HTS） is proposed for solving bi-criteria No-idle permutation flow Shop Scheduling Problem in this paper.Two objectives,i.***.the maximum completion time （makespan） and the Total Flow Time （TFT）,are considered at the same time.The initial solution of the Tabu Search Algorithm is generated by the famous NEH heuristic.A speed-up method is introduced both in NEH and HTS to improve the efficiency of the algorithm.Then the dynamic feature of the tabu list length is applied to improve the robustness of the algorithm.And a local search method is embedded in the HTS to improve the exploitation capability of the algorithm.It is proved by the extensive computational experiments that the HTS algorithm is superior to the existing algorithms both in computing effectiveness and searching ability.

关键词： No-idle permutation flow Shop Scheduling Makespan Total Flow Time Tabu Search Algorithm Multi-objective optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Harmony Search Algorithms for Bi-criteria No-idle permutation flow Shop Scheduling Problem

Harmony Search Algorithms for Bi-criteria No-idle permutatio...

引用

2011 Chinese Control and Decision Conference（CCDC）

作者： Wen-Juan REN is with the College of Computer Science,Liao Cheng University,CO 252059,China.Jun-Hua DUAN is with the College of Computer Science,Liao Cheng University,CO 252059,China.Hong-yan Han is with the College of Mathematic,Liao Cheng University,CO 252059,China.Feng-rong Zhang is with the College of Computer Science,Liao Cheng University,CO 252059,China.Min Zhang is with the College of Computer Science,Liao Cheng University,CO 252059,China.

Three hybrid harmony search （HS） algorithms are proposed for solving Bi-criteria No-idle permutation flow Shop Scheduling Problem in this paper.Two objectives,i.***.the maximum completion time （makespan） and the Total Flow Time （TFT）,are considered simultaneously.The proposed algorithms firstly convert continuous harmony vectors into job permutations according to the largest position value （LPV） rule.Then the algorithms use the NEH algorithm to initialize one harmony and the others are initialized randomly.Lastly,a local search method is used in the proposed algorithms to enhance the exploitation capability.The extensive computational experiments demonstrate the high effectiveness and searching ability of the hybrid harmony algorithms especially the hybrid Globalbest harmony search （hGHS） algorithm.

关键词： Hybrid harmony search Multi-objective optimization Makespan Total Flow Time

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：