期刊文献+

带有并行机的混合Job Shop调度问题 被引量:2

下载PDF
导出
摘要 本文分析带有并行机的混合Job Shop调度问题并建立其模型,利用改进的遗传算法求解问题,在算法设计中,采用基于工序的编码方式,分两步进行解码,给出相关的遗传操作,列举实例说明带有并行机的混合Job Shop调度问题,并针对实例进行仿真实验验证算法和编码方式的有效性和可行性,最后指出进一步的研究方向。
出处 《中国管理信息化》 2010年第14期65-67,共3页 China Management Informationization
  • 相关文献

参考文献5

二级参考文献19

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:115
  • 2Kramer F J,Porduction and Operations Meanagement,1994年
  • 3Cheng T C E,Comput Opns Res,1988年,15卷,1期,91页
  • 4N.Nasr and E.A.Elsayed. Job Shop scheduling with alter-native machines[J]. International Journal Production Research, 1990,28(9),1595~1609
  • 5R.W.Cheng, M.Gen and Y.Tsujimura. A tutorial Survey of Job-shop Scheduling Problems Using Genetic Algorithms-I[J]. Computers Industry Engineering,1996,130(4), 983~997
  • 6Z. Michalewicz, D. D. Upta and R. G. Le Riche. Evolu-tionary Algorithms for Industrial Engineering Problems[J]. International Journal of Computers and Industrial Engineering, 1996, 30(4):369~372
  • 7M.Gen. and T.Kobayashi. Solving job-shop scheduling pro-blems using genetic algorithms[A].Proceedings of the 16th International Conference on Computer and Industrial Engineering[C].1994
  • 8M.Yagiura and T.Ibaraki. The Use of Programming in Ge-netic Algorithms for Permutation Problem[J]. European Journal of Operation Research, 1996, (92)
  • 9G. Shi. A genetic Algorithm Applied to a Classic Job-shop Scheduling Problem [J]. International Journal of Systems Science, 1997,28(1):25~32
  • 10DE JONG K A. An analysis of the behavior of a class of genetic adaptive systems[D]. Michigan: University of Michigan, 1975.

共引文献117

同被引文献11

  • 1黄洪钟,李丽,刘伟.并行工程中设计任务的动态调度[J].机械工程学报,2002,38(z1):164-167. 被引量:12
  • 2鞠全勇,朱剑英.多目标批量生产柔性作业车间优化调度[J].机械工程学报,2007,43(8):148-154. 被引量:64
  • 3CHANG P T, LINK E Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel machine scheduling problem[J]. International Journal of Production Research, 2009, 46(20): 5719-5759.
  • 4DUGARDIN F, CHEHADE H, AMODO L, et al. Hyprid job shop and parallel machine scheduling problem: Minimization of total tardiness criterion[C/CD]// Multiprocessor Scheduling: Theory and applications, Vienna, Austria, 2007.
  • 5CHRISTOFOROS C, KRZYSZTOF F, KHALIL S H. A hybrid searching method for the unrelated parallel machine scheduling Problem[C]// AIAI 2010 6th IFIP Conference on Artificial Intelligence Application & innovations, October 6-7, 2010, Laruaca, Cyprus: 230-237.
  • 6AZIZOGLU M. Scheduling jobs on unrelated parallel machines to minimize regular total cost functions[J]. IIE Transactions, 2002, 31(2): 153-159.
  • 7CORREA J R, SKUTELLA M, VERSCHAE J. The power of preemption on unrelated machines and applications to scheduling orders[C]// APPROX and RANDOM 2009: 84-97.
  • 8CHYU C C, CHANG W S. A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems[J]. International Journal of Advanced Manufacturing Technology, 2010, 49: 697-708.
  • 9DORGO M, STTZLE T. Ant colony optimization[M]. Cambrige, MA: MIT Press, 2004.
  • 10BECK J C, REFALO P. A hybrid approach to scheduling with earliness and tardiness costs[J]. Annals of Operations Research, 2003, 118(1/2/3/4): 49-71.

引证文献2

二级引证文献69

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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