期刊文献+

制造业的车间调度问题优化算法比较研究 被引量:2

Comparative Research on Scheduling Problem in Manufacturing
下载PDF
导出
摘要 目前,制造业的竞争日益激烈,在企业的日常运作过程中,会经常遇到各种各样的复杂的调度问题,车间生产调度问题解决的好坏直接影响着企业的运作效率和最终的客户满意程度,最终影响着企业对市场的反应能力和竞争力。因此,调度问题已经成为运营管理领域的一大研究热点。大量的学者研究生产调度优化问题,采用了各种优化方法。文章综述了车间生产调度问题的各种优化方法,对其发展历程、优缺点、适用性等都作了详细的说明,并对它们作以比较分析,从而找到最适合现实状况的优化方法。 At present, competition in manufacturing is growing tougher and tougher. There are all kinds of complicated scheduling problem in operations of manufacturing companies. How to solve the scheduling problem will affect the efficiency and the customer's satisfaction, and the power and response ability of the company. So scheduling problem becomes a very popular problem in OM. Lots of scholars adopts 'various methods to solve actual problem. This paper sums up all kinds of methods of scheduling problem and particularly explain merit and disadvantages, evolution course and applicability, which compare and analyze them each other in order to discover best of realistic status's optimum methods.
作者 郑睿
机构地区 复旦大学
出处 《物流科技》 2008年第6期117-119,共3页 Logistics Sci-Tech
基金 复旦大学研究生创新基金资助
关键词 调度问题 最优化算法 启发式算法 scheduling problem optimized algorithm heuristic algorithm
  • 相关文献

参考文献6

二级参考文献19

  • 1黄志,黄文奇.作业车间调度问题的一种启发式算法[J].计算机工程与应用,2004,40(26):25-27. 被引量:1
  • 2张长水,阎平凡.解Job-shop调度问题的神经网络方法[J].自动化学报,1995,21(6):706-712. 被引量:38
  • 3M R Garey,D S Johnson.Computer and Intractability:A Guide to the Theory of NP-Completeness.San Francisco, Freeman, 1979. 被引量:1
  • 4J Adams,E Balas,D Zawack.The Shifting Bottleneck Procedure for job Shop Scheduling[J],Management Science,1988,34(3):391-401. 被引量:1
  • 5E Balas,A Vazacopoulos.Guided Local Search with Shifting Bottleneck for Job Shop Scheduling[J].Management Seienee,1998,44(2): 262-275. 被引量:1
  • 6F Pezzella,E Merelli.A tabu search method guided by shifting bottleneck for the job shop scheduling problem[J].European Journal of Operational Research, 2000 ; 120 : 297-310. 被引量:1
  • 7E Nowicki,C Smutnicki.A fast taboo search algorithm for the job shop problem[J].Management Science, 1996;42(6) :797-813. 被引量:1
  • 8H Wenqi,Y Aihua.An improved shifting bottleneck procedure for the job shop scheduling problem[J].Computer and Operations Research, 2004;31 (12) :2093-2110. 被引量:1
  • 9E Balas. Machine sequencing via Disjunctive Graphs:An Implicit Enumeration Algorithm[J].Oper Res, 1969; 17 (3) : 941 -957. 被引量:1
  • 10P J M Van Laarhoven,E H L Arts,J K Lenstra.Job shop scheduling by simulated annealing[J].Operations research, 1992 ;40( 1 ) : 113-125. 被引量:1

共引文献46

同被引文献9

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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