期刊文献+

车间作业调度问题中调度规则算法的设计方法研究进展 被引量:4

Design of dispatching rules in dynamic job shop scheduling problem
原文传递
导出
摘要 调度规则是解决实际生产中的动态车间作业调度问题的有效方法,但它的效率取决于系统特征、加工条件参数和调度目标,因此没有一个规则在所有的调度环境下都比其他规则要好。综述了调度规则的发展、分类及特点,并对调度规则的设计方法进行总结。介绍了调度规则的设计方法,包括早期使用的手工方法和表现较好的智能方法,给出进化算法、遗传规划和数据挖掘方法,并分析比较了其优缺点。针对调度规则设计方法存在的不足,指出了未来的研究方向。 The dispatching rule is an effective tool for solving the dynamic job shop scheduling problem in practical productions. However,no single rule can outperform others under various scheduling circumstances, as the effectiveness of the dispatching rule depends on the shop configurations, the operating conditions and the performance measures. To study the dynamic job shop scheduling problem in practical productions, the methods for the development and the design of dispatching rules are reviewed in this paper. The development, the classification and the characteristics of dispatching rules are discussed, and the research hotspots of dispatching rules and the design methods are summarized. The design methods of dispatching rules include the popular manually performed method and the effective artificial intelligence method. In addition, the research results and the conclusions of the evolutionary algorithm, the genetic programming and the data mining methods for the design of dispatching rules are presented. The advantages and disadvantages of these methods are analyzed and compared. Finally the direction of future researches is pointed out.
出处 《科技导报》 CAS CSCD 北大核心 2016年第2期33-38,共6页 Science & Technology Review
基金 国家自然科学基金项目(71271160) 湖北省教育厅科研计划重点项目(D20121102)
关键词 车间作业调度问题 调度规则 进化算法 遗传规划 数据挖掘 job shop scheduling problem dispatching rules evolutionary algorithm genetic programming data mining
  • 相关文献

参考文献36

  • 1Gere W S. Heuristics in job shop scheduling[J]. Management Science, 1966, 13(3): 167-190.
  • 2Haupt R. A survey of priority rule-based scheduling[J]. Operations Re-search Spektrum, 1989, 11(1): 3-16.
  • 3Panwalker S S, Iskandar W. A survey of scheduling rules[J]. Operations Research, 1977, 25(1): 45-61.
  • 4刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2001.
  • 5Glover F, Greenberg H J. New approaches for heuristic search: A bilat-eral linkage with artificial intelligence[J]. European Journal of Opera-tions Research, 1989, 39 (2): 119-130.
  • 6Blackstone J H, Phillips D T, Hogg G L. A state-of-the-art survey of dispatching rules for manufacturing job shop operations[J]. International Journal of Production Research, 1982, 20(1): 27-45.
  • 7Oliver H, Chandrasekharan R. Efficient dispatching rules for schedul-ing in a job shop[J]. International Journal of Production Economics, 1997, 48(1): 87-105.
  • 8Ramasesh R. Dynamic job shop scheduling: A survey of simulation re-search[J]. Omega, 1990, 18(1): 43-57.
  • 9Grady O P, Lee K H. An intelligent cell control system for automated manufacturing[J]. International Journal of Production Research, 1988, 26(5): 845-861.
  • 10Pierreval H. Expert system for selecting priority rules in flexible manu-facturing systems[J]. Expert Systems with Applications, 1992, 5(1-2): 51-57.

二级参考文献12

  • 1熊禾根,李建军,孔建益,杨金堂,蒋国璋.考虑工序相关性的动态Job shop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55. 被引量:33
  • 2刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2001.
  • 3Jonson S M.Optional two and three-stage production schedulingwith set-up times included[J].Naval Research Logistics Quarterly,1954,1:64-68.
  • 4Blazewicz J,Domschke W,Pesch E.The job shop schedulingproblem:conventional and new techniques[J].European Journal of Operational Research,1996,93(1):1-33.
  • 5Haupt R.A survey of priority rule-based scheduling[J].OR Spektrum.1989,11:3-16.
  • 6Vinod ViSridharan R.Scheduling a dynamic job shop productionsystem with sequence-dependent setups:An experimental study[J].Robotics and Computer-Integrated Manufacturing,2008,24(3):435-449.
  • 7Binchao Chen,Timothy I.Matis.A flexible dispatching rule forminimizing tardiness in job shop scheduling[J].International Journal of Production Economics,2013,141(1):360-365.
  • 8Eva Vallada,Ruben Ruiz,Gerardo Minella.Minimising totaltardiness in the m-machine flowshop problem:A review andevaluation of heuristics and metaheuristics[J].Computers and Operations Research.2008,35(4):1350-1373.
  • 9Baker K R,Bertrand J W M.A dynamic priority rule forscheduling against due-dates[J].Journal of Operations Management,1982,3(1):37-42.
  • 10Conway R W,Maxwell WL,Miller LW.Theory of scheduling[J].Addison-Wesley,1967,Reading,MA.

共引文献6

同被引文献27

引证文献4

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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