期刊文献+

车间作业的混合组合规则调度方法 被引量:2

A Mixed Dispatching Rule Approach in Job Shop Scheduling
在线阅读 下载PDF
导出
摘要 分析多种类型零件投放车间时根据零件工艺路线特点,在不同机床上选用适当的启发式调度规则,实现车间调度周期内的多规则混合调度(MDR-MixedDispatchingRule)的方法。实验结果表明,针对具体加工任务和加工资源特点,通过有限步的仿真搜索所形成的多规则混合调度,算法性能比通常所采用的针对所有机床的单规则调度算法有明显提高。该方法已应用于作者开发的车间控制器中。 We extended the method of Ishii et al[1] for FMS(Flexible Manufacturing System)scheduling to the more general case of job shop scheduling,where,unlike FMS, the flow of workpieces is more flexible.We developed a knowledge -based job shop scheduling algorithm as the shop controller of an aircraft factory.This algorithm includes two important strategies:(1) Unlike Ishii et al,we determine the bottleneck machine by that total time needed by it to machine all the workpieces in the job queue is the highest among all machines.(2) We, after ascertaining that Ishii et al gave no clues at all,deem that the worst workpiece should be that one that requires the largest flow time.Figs.2 and 3 give the results of our stochastic simulation experiments with SIMAN language model.Figs.2 and 3 show the variations of MFT and (MFT+MAL) respectively with strategy searching steps.Figs.2 and 3 show clearly that our mixed dispatching rule method is more effective than single rule method in dealing with this characteristics of job scheduling.
机构地区 西北工业大学
出处 《西北工业大学学报》 EI CAS CSCD 北大核心 1996年第4期627-632,共6页 Journal of Northwestern Polytechnical University
基金 国家863CIMS主题资助 国家自然科学基金
关键词 优先调度规则 混合规则控制 车间调度 车间作业 job shop scheduling, mixed dispatching rule, shop controller
  • 相关文献

参考文献1

  • 1陈荣秋,CIMS.China’92论文集

同被引文献14

  • 1吕文彦,党延忠.基于B-T规则与遗传算法的可重入生产系统调度[J].系统仿真学报,2005,17(4):993-996. 被引量:9
  • 2王国新,宁汝新,王爱民,唐承统,武志军.基于仿真的调度规则组合决策研究[J].北京理工大学学报,2006,26(7):598-601. 被引量:11
  • 3王国新,宁汝新,王爱民.基于仿真的生产调度优化技术研究[J].计算机集成制造系统,2007,13(7):1419-1427. 被引量:31
  • 4张宏芳 李小平 周品.面向车间作业问题的一个病毒遗传算法[A]..杭州:第五届全球智能控制与自动化大会论文集[C].,2004(3).2132-2136.
  • 5PETER B, BEMD J, BEMDS. A branch and bound algorithm for the job - shop scheduling problem[J]. Discrete Appl. Math. 1994, (49): 107 - 227.
  • 6L. WANG L. ZHANG DA - ZHONG ZHENG. A Class of Orderbased Genetic Algorithm for Flow Shop Scheduling[ J]. Int J Adv ManufTechnol,2003, (22) :828 - 835.
  • 7R. HEILMANN. A branch- and - bound procedure for the multimode resource - constrained project scheduling problem with minimum and maximum time lags[ J ]. European Journal of Operational Research, 2003, (144): 348- 365.
  • 8HURINK J TABU, KNUST SIGRID. search algorithms for job - shop problems with a single transport robot [ J ]. From Theory to Application. 2005,(4) :99- 111.
  • 9DIMITRIS BERTSIMAS, JAY SETHURAMAN. From Fluid Relaxations to Practical Algorithms for Job Shop Scheduling[ J]. the Makespan Objective. Math. Program, Ser. A, 2002,(92):61 - 102.
  • 10霍佳震,钟海嫣,吴群,刘桂林.钢管生产调度中可中断Job-Shop问题的数学模型[J].系统仿真学报,2008,20(11):2789-2792. 被引量:3

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部