检索结果-南通市图书馆

On Two-machine flow shop Scheduling

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2014年第3期2卷 333-339页

作者： Lin Chen Wen-Chang Luo Guo-Chuan Zhang College of Computer Science Zhejiang UniversityHangzhou 310027China Faculty of Science Ningbo UniversityNingbo 315211China

In this note,we revisit the classical two-machine flow shop scheduling problem.A linear time approximation scheme is presented.For an online version with rejection,we propose best possible online algorithms.

关键词： flow shop Linear time Online algorithm

A Fast Method for Heuristics in Large-Scale flow shop Scheduling

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2006年第1期11卷 12-18页

作者：李小平刘连臣吴澄 Department of Automation Tsinghua UniversityBeijing 100084 China Department of Computer Science and Technology Harbin University of Science and Technology Harbin 150080 China

Fast computation methods are needed for the heuristics of flow shop scheduling problems in practical manufacturing environments. This paper describes a generalized flow shop model, which is an extension of the classical model, in which not all machines are available at time zero. The general completiontime computing method is used to compute completion time of generalized flow shops. The transform classical flow shop to generalized shop （TCG） method is used to transform classical schedules into generalized schedules with less jobs. INSERT and SWAP, extended from job-insertion and pair-wise exchange which are fundamental procedures used in most heuristics for classical flow shops, reduce the CPU time by 1/2 and 1/3, respectively. The CPU time of 14 job-insertion and pair-wise exchange-based heuristics are analyzed with and without the TCG method. The results show that TCG considerably reduces the CPU time

关键词： scheduling heuristic flow shop total completion-time

求解无等待flow shop调度问题的改进蛙跳算法

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

组合机床与自动化加工技术 2020年第7期 81-84页

作者：吴永明王亚昆张晗赵旭东陈琳升史海鹏贵州大学现代制造技术教育部重点实验室贵阳550025

无等待flow shop调度一直是研究的热点问题,为减少无等待流水车间调度总完工时间,文章提出了一种结合高斯变异和扰动因子的蛙跳算法。在蛙群更新策略中引入扰动因子,平衡了蛙跳算法搜索的深度,利用高斯变异产生子代新蛙代替随机产生子... 详细信息

无等待flow shop调度一直是研究的热点问题,为减少无等待流水车间调度总完工时间,文章提出了一种结合高斯变异和扰动因子的蛙跳算法。在蛙群更新策略中引入扰动因子,平衡了蛙跳算法搜索的深度,利用高斯变异产生子代新蛙代替随机产生子代新蛙,增强了蛙跳算法的寻优速度;同时引入交叉操作,增加蛙群的多样性,提高蛙群中所有青蛙的局部搜索能力以及全局搜索能力。研究了无等待flow shop调度算例,将蛙跳算法与遗传算法的求解结果进行了对比,结果验证了该文改进蛙跳算法在解决无等待流水车间调度问题的有效性和可行性。

关键词： flow shop 蛙跳算法调度

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

flow shop的交付期确定及调度

Flow Shop的交付期确定及调度

1994年中国控制会议

作者：齐向彤涂奉生南开大学计算机与系统科学系南开大学计算机与系统科学系

E／T调度是和JIT生产思想一致的．但多数E／T调度仅研究的是单机情况．本文研究一类多机问题,flow shop的公共交付期确定及调度问题,给出了将问题分解为单机E／T问题和 flow shop的Tmax问题的算法．

关键词：离散事件系统调度 flow shop JIT 提前／拖后

在线全文

cnki会议

学校读者我要写书评

暂无评论

m-机器flow shop随机调度问题

m-机器Flow Shop随机调度问题

第二十届中国控制会议

作者：贾春福李勇建涂奉生南开大学计算机与系统科学系南开大学计算机与系统科学系南开大学计算机与系统科学系

本文利用随机flow shop的一个性质,讨论了同一工件在不同机器上的加工时间独立同分布时,m台机器flow shop随机调度问题．机器之间具有存储器,其容量充分大,使得加工过程不会出现阻塞．目标函数分别为: （1）工件完成时间和的期望, （2... 详细信息

本文利用随机flow shop的一个性质,讨论了同一工件在不同机器上的加工时间独立同分布时,m台机器flow shop随机调度问题．机器之间具有存储器,其容量充分大,使得加工过程不会出现阻塞．目标函数分别为: （1）工件完成时间和的期望, （2）工件拖后时间和的期望和（3）拖后工件数．在加工时间可随机比较大小时,给出了上述目标函数最小化问题的最优解．

关键词：随机调度 flow shop 随机序完成时间拖后时间拖后工件数

Solving the flow shop Problem with Limited Buffers Using Differential Evolution

在线全文

cnki会议

学校读者我要写书评

暂无评论

Solving the Flow Shop Problem with Limited Buffers Using Dif...

2011 Chinese Control and Decision Conference（CCDC）

作者： Jun-hua Duan is with the school of computer science,Liaocheng University,Liaocheng,China.Guang-Yu Qiao,China united network communications company limited liaocheng Branch..Min Zhang is with the school of computer science,Liaocheng University,Liaocheng,China.

This paper aims to minimize makspan for the flow shop scheduling problem with intermediate buffers using a discrete differential evolution （DDE） algorithm.In the algorithm,we apply job-permutation-based mutation and crossover operators to generate new candidate solutions,and employ an NEH-based initialization method to produce an initial population.Computational simulations and comparisons show that the proposed DDE algorithm generates better results than the existing hybrid genetic algorithm and hybrid particle swarm optimization in terms of solution quality and robustness.

关键词： flow shop Makespan Differential evolution Heuristics

Heuristic Algorithm Based on the Crucial Machine for the No-Wait flow-shop Scheduling

在线全文

cnki会议

学校读者我要写书评

暂无评论

Heuristic Algorithm Based on the Crucial Machine for the No-...

2009中国控制与决策会议

作者： HONG Zong-you~1,PANG Ha-li~2 1.Department of Science,Shenyang Institute of Chemical Technology,Shenyang 110142 2.Institute of Systems Engineering,Northeastern University,Shenyang 110006

＜正＞No-Wait flow shops characterized as the continuity of job in processing,once it begins,subsequent processing must be carried out with no delay in the passage of the job from machine to machine.Addressing the problem with objective of makespan,a constructive heuristic algorithm was proposed in this article that based on the properties of the Crucial Machine and the job insertion method.Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm.

关键词： Scheduling flow shop Heuristic No-Wait

Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop

在线全文

cnki会议

学校读者我要写书评

暂无评论

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

基于内分泌激素调节机制的自适应免疫算法的flow shop调度问题

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于内分泌激素调节机制的自适应免疫算法的flow shop调度问题

第二十六届中国控制会议

作者：王祎顾幸生徐震浩华东理工大学信息科学与工程学院

针对间歇生产过程中存在的无限中间储罐的flow shop调度问题,建立了相应的数学模型;并基于内分泌激素调节规律,提出了一种新颖的解决此类问题的自适应内分泌免疫调度算法。仿真实例表明,该算法的收敛速度和搜索精度均优于改进的免疫算法... 详细信息

针对间歇生产过程中存在的无限中间储罐的flow shop调度问题,建立了相应的数学模型;并基于内分泌激素调节规律,提出了一种新颖的解决此类问题的自适应内分泌免疫调度算法。仿真实例表明,该算法的收敛速度和搜索精度均优于改进的免疫算法,证明了该算法的有效性和优越性。

关键词：生产调度内分泌免疫算法 flow shop 无限中间储罐