期刊文献+

大力提高企业的技术创新能力

原文传递
导出
出处 《理论学习(浙江)》 2000年第2期31-33,共3页
  • 相关文献

参考文献8

二级参考文献76

  • 1崔建双,李铁克,张文新.混合流水车间调度模型及其遗传算法[J].北京科技大学学报,2005,27(5):623-626. 被引量:29
  • 2梁静,钱省三,马良.基于双层蚂蚁算法的半导体炉管制程批调度研究[J].系统工程理论与实践,2005,25(12):96-101. 被引量:7
  • 3Norman B A. Scheduling flowshops with finite buffers and sequence-dependent setup times[J].Computers & Industrial Engineering, 1999, 36: 163-177. 被引量:1
  • 4Smutnicki C. A two-machine permutation flow-shop scheduling with buffers[J]. OR Spectrum, 1998, 20 : 229-235. 被引量:1
  • 5Nowicki E. The permutation flow shop with buffers: a tabu search approach[J].European Journal of Operational Research, 1999, 116: 205-219. 被引量:1
  • 6Brucker P, Heitmann S, Hurink J. Flow-shop problems with intermediate buffers[J]. OR Spectrum, 2003, 25: 549-574. 被引量:1
  • 7Ronconi D P. A note on constructive heuristics for the flowshop problem with blocking[J].International Journal of Production Economics, 2004, 87: 39-48. 被引量:1
  • 8Caraffa V, Ianes S, Bagchi T P, et al. Minimizing makespan in a blocking flowshop using genetic algorithms[J]. International Journal of Production Economics, 2001, 70: 101-115. 被引量:1
  • 9Mascis A, Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints[J].European Journal of Operational Research, 2002, 143: 498-517. 被引量:1
  • 10Sawik T. Mixed integer programming for scheduling flexible lines with limited intermediate buffers[J]. Mathematical and Computer Modeling, 2000: 31: 39- 52. 被引量:1

共引文献76

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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