基于多准则群决策的作业车间多调度方案排序算法  

A Sequence Analysis Algorithm for Multifarious Flexible Job-shop Schedules Using Colony-deciding Method

作　　者：陈洪亮[1] 孙树栋[1] 

机构地区：[1]西北工业大学机电学院,西安710072

出　　处：《机械科学与技术》2010年第11期1501-1504,共4页Mechanical Science and Technology for Aerospace Engineering

基　　金：国家科技支撑计划项目(2006BAF01A03)资助

摘　　要：为了解决作业车间多种调度方案的选择问题,笔者提出了基于多准则群决策的作业车间多调度方案排序方法,从加工设备、制造成本、加工顺序等多目标对调度方案进行群决策分析,实现多调度方案的排序,获得最符合车间生产实际要求的作业车间调度方案,采用算例验证了算法的正确性和可行性。In the process of product manufacturing,there are many Flexible Job-shop Schedules （FJS） for a workshop. It is very difficult to select a suitable FJS. In order to choose the optimal FJS from the multifarious schedules for a workshop in a certain time,we present a new sequence analysis algorithm for multifarious Flexible Job-shop Schedules Problem （FJSP） based on colony-deciding method. The colony-deciding method is applied to analyze the multi-objectives,such as machining fixture,manufacturing cost and the sequence of machining,to form the schedule scheme sequence. The optimal FJSP solution can be obtained according to the schedule scheme sequence. We apply the algorithm successfully to analyze an example and select the optimal FJSP solution for a workshop of an aircraft manufactory.

关 键 词：作业车间调度 调度方案排序 多准则 群决策 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]