面向多订单的JSP建模及其蚁群算法实现  

Modeling and Ant Colony Algorithm Implementation of Multi-order Oriented Job-shop Scheduling Problem

作　　者：李言[1] 刘永[1] 李淑娟[1] 杨明顺[1] 

机构地区：[1]西安理工大学,西安710048

出　　处：《中国机械工程》2009年第18期2198-2202,共5页China Mechanical Engineering

基　　金：陕西省教育厅资助项目(08JK389);教育部春晖计划资助项目(Z2005-1-61004)

摘　　要：以实施JIT生产策略为目标,研究了多品种小批量生产企业在多订单生产环境下的作业车间调度问题,建立了基于提前和延期惩罚的作业调度问题优化的整数规划模型。该模型着重考虑产品装配结构约束和订单交货期约束,以降低由在制品库存引起的生产成本,确保最终获得全局最优可行解。设计了带精英策略的蚁群算法来求解该模型,并通过实例仿真验证了所建模型的正确性以及蚁群算法求解该问题的可行性和有效性。With the aim of implementing JIT production strategy, this research studied the JSP of batch production enterprise under the circumstance of satisfying multi--order production, established an integer programming model that optimized the job scheduling based on the earliness and tardiness penalties of the JSP. This integer programming model mainly took into account the constraints of production assemble and order delivery time so as to reduce the cost increased by inventory management of work in process and eventually obtain the global optimal feasible solution. Finally, this research designed an an ant colony algorithm with elitist strategy to solve the mathematical model, provided an instance emulation mode to illustrate the correctness of the model and the feasibility and validity of the algorithm.

关 键 词：面向多订单 作业车间调度问题 蚁群算法 精英策略 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置]