一种基于加工匹配度的车间作业调度方法研究  

An Algorithm for Job Shop Scheduling Based on Matching Quotiety of Processing

作　　者：严泽强[1] 刘飞[1] 曹乐[1] 鄢萍[1] 

机构地区：[1]重庆大学制造工程研究所,重庆400044

出　　处：《世界科技研究与发展》2008年第3期270-274,共5页World Sci-Tech R&D

基　　金：国家863重点项目(项目编号:2007AA040701);重庆市科技攻关项目(项目编号:CSTC2007AA2013)的资助

摘　　要：单件小批量生产形式下的作业车间调度是生产调度中的重要问题。在综合考虑订单优先级、加工时间等诸多因素的基础上,提出了加工匹配度的概念来研究作业调度问题,建立了相应的调度模型,设计了一种启发式作业调度算法。在某制动阀生产企业数控车间的实际应用结果表明,该方法能够较好的辅助车间调度人员进行车间作业调度。Job-shop scheduling in small batch production is an important problem of production scheduling. On the basis of considering in the priority orders, processing time, and many other factors, a matching quotiety of processing been introduced to study the job-scheduling problem which is followed by the born of a corresponding scheduling model and a heuristic scheduling algorithms. Application results in a brake valve manufacturing workshop show that the method can support Scheduling staff Job Shop Scheduling better.

关 键 词：作业调度 启发式算法 加工匹配度 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]