制造业的车间调度问题优化算法比较研究
作者：郑　睿
来源：《物流科技》2008年第06期

        摘要：目前，制造业的竞争日益激烈，在企业的日常运作过程中，会经常遇到各种各样的复杂的调度问题，车间生产调度问题解决的好坏直接影响着企业的运作效率和最终的客户满意程度，最终影响着企业对市场的反应能力和竞争力。因此，调度问题已经成为运营管理领域的一大研究热点。大量的学者研究生产调度优化问题，采用了各种优化方法。文章综述了车间生产调度问题的各种优化方法，对其发展历程、优缺点、适用性等都作了详细的说明，并对它们作以比较分析，从而找到最适合现实状况的优化方法。

        关键词：调度问题；最优化算法；启发式算法

        中图分类号：F273文献标识码：A

        文章编号：1002-3100(2008)06-0117-03

        Abstract: 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.

制造业的车间调度问题优化算法比较研究