节点文献

基于混合遗传算法的有限能力作业车间调度

Finite Capacity Job-Shop Scheduling Based on Hybrid Genetic Algorithm

【作者】 刘辉

【导师】 高迎平;

【作者基本信息】 河北工业大学 , 管理科学与工程, 2006, 硕士

【摘要】 随着世界进入信息化时代,制造业所处的环境不断改变,大多数企业的生产模式己由过去的大批量生产转化为单件小批生产。在这种环境下,企业如何运用有限的资源,快速响应客户需求,提高效率,降低成本,保证按时交货,已成为制造企业在竞争中生存的一个重要条件。车间调度是制造系统生产管理的核心,它对于提高产品质量、降低成本、提高效率等生产管理的各个方面都起着至关重要的作用。车间调度已成为制造业生产领域中研究的热点问题之一,但由于车间调度具有动态随机性、计算复杂性的特点,至今尚未出现一套系统的方法和理论。探求有效的调度方法与优化技术,对于提高制造企业的现代化水平具有重要的理论意义和实用价值。本文在综合研究国内外关于车间调度问题的基础上,考虑现行作业车间运作特点,对作业车间的生产调度问题进行了深入系统的研究。首先,针对经典作业车间调度问题的局限性,结合车间生产的实际情况,研究建立了有限能力作业车间调度模型。其次,针对传统遗传算法存在过早收敛及后期搜索效率低的问题,设计了混合遗传算法,该算法有效融合多种群遗传算法与模拟退火算法的优点,对该算法在有限能力作业车间调度优化的具体应用进行了详细地设计,并给出问题求解的仿真实验结果。最后基于有限能力作业车间调度模型和混合遗传算法,设计开发了有限能力作业车间调度系统。

【Abstract】 Wiht the word entering informationization time, the environment which the manufacturing industry locates unceasingly changes, Majority enterprise’s production pattern transformed by the past mass production as the single-piece and small-batch production.Nnder this kind of production environment, how the enterprise utilize the limited resources to fast response customer demand, reduce the production cost, guarante delivers on time, becomes the manufacture enterprise an important condition which survives in the competition. The job-shop scheduling is the core of manufacture productionsystem,it can improve the production efficiencyand product quality, reduce the cost, and so on .Therefore, the workshop scheduling is one of hot topics which in the manufacturing production studies. Because the workshop scheduling has the dynamic randomness, the computation complex characteristic, at present not yet appears the effective theory solves the workshop scheduling problem. Seeks the effective dispatch method and the optimization techniques, has the important theory significance and the practical value regarding the enhancement manufacture enterprise’s modernized level.On the basis of the technical review on the domestic and foreign research,this thesis has an extensive and systematic study on the job-shop scheduling.Firstly,direct against the limitation of classical job-shop scheduling, combine the actual conditions of the workshop, deployment model of finite capacity job-shop scheduling. Secondly, In order to avoid permature convergence and slow convergent speed at later evolution process of traditional genetic algorithm,a hybrid algorithm was proposed to solve finite capacity job-shop scheduling problems. This algorith is effectively combined with the merits of simulated annealing and multigroup genetic, and simulation results validate the effectiveness of the proposed algorithm. Finally, develop the finite capacity job-shop scheduling system.

  • 【分类号】F224
  • 【被引频次】2
  • 【下载频次】219
节点文献中: 

本文链接的文献网络图示:

本文的引文网络