国家自然科学基金(61104178)

作品数：6被引量：16H指数：2
导出分析报告
相关作者：樊亚宁顾幸生徐震浩更多>>
相关机构：化工过程先进控制和优化技术教育部华东理工大学更多>>
相关期刊：《Journal of Donghua University(English Edition)》《Chinese Journal of Chemical Engineering》《自动化仪表》《Journal of Central South University》更多>>
相关主题：TARDINESSBUFFERSINTERMEDIATEEFFECTIVEDESTRUCTION更多>>
相关领域：自动化与计算机技术化学工程一般工业技术更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Scatter Search Based Particle Swarm Optimization Algorithm for Earliness/Tardiness Flowshop Scheduling with Uncertainty被引量：2
《International Journal of Automation and computing》2016年第3期285-295,共11页Jia-Can Geng Zhe Cui Xing-Sheng Gu 
supported by National Natural Science Foundation of China(Nos.61174040 and 61104178);Shanghai Commission of Science and Technology(No.12JC1403400);the Fundamental Research Funds for the Central Universities
Considering the imprecise nature of the data in real-world problems, the earliness/tardiness （E/T） fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fu...
关键词：Earliness/tardiness （E/T） SCHEDULING fuzzy modeling scatter search （SS） particle swarm optimization （PSO）. 
An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers被引量：3
《Journal of Central South University》2015年第9期3471-3484,共14页张素君 顾幸生 
Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of China;Project(12JC1403400) supported by Shanghai Commission of Science and Technology,China;Project supported by the Fundamental Research Funds for the Central Universities,China
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...
关键词：discrete artificial bee colony algorithm flow shop scheduling problem with intermediate buffers destruction and construction tournament selection 
Combined Timetabling Procedure and Complete Local Search for No-Wait Job Shop Scheduling with Total Tardiness被引量：1
《Journal of Donghua University(English Edition)》2014年第2期83-91,共9页杨玉珍 顾幸生 
National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China
The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...
关键词：job shop scheduling NO-WAIT TIMETABLING TARDINESS complete local search with memory 
Hybrid Discrete Harmony Search Algorithm for Flow Shop Scheduling with Limited Buffers
《Journal of Donghua University(English Edition)》2014年第2期171-178,共8页崔喆 顾幸生 
National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China
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 p...
关键词：multiproduct processes scheduling problem limited buffers total flow time harmony search 
SUPMAX800D智能I/O卡上位机设计
《自动化仪表》2013年第1期28-31,36,共5页樊亚宁 徐震浩 顾幸生 
国家自然科学基金资助项目(编号:61104178;61174040)
当普通分散控制系统的主控制器发生故障时,整个系统将失去逻辑控制功能,为此设计了具有逻辑控制功能的智能I/O卡。在智能I/O卡硬件设计的基础上,以VC2008为开发平台,提出了智能I/O卡的上位机软件设计方案。该方案实现了下载组态、控制...
关键词：分散控制系统(DCS) 主控制器 智能I O卡 上位机软件 组态 
A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling被引量：10
《Chinese Journal of Chemical Engineering》2012年第6期1067-1073,共7页邓冠龙 徐震浩 顾幸生 
Supported by the National Natural Science Foundation of China (61174040, 61104178);the Fundamental Research Funds for the Central Universities
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...
关键词：blocking flow shop scheduling artificial bee colony algorithm total flow time 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部