混合FlowShop的调度仿真系统及其算法分析  

Scheduling Simulation System of Hybrid Flow Shop and Algorithms Analysis

作　　者：陈玉旺[1] 杨根科[1] 

机构地区：[1]上海交通大学自动化系,上海200030

出　　处：《系统仿真学报》2004年第10期2161-2164,共4页Journal of System Simulation

基　　金：国家自然科学基金(60174009);西安交通大学机械制造系统工程国家重点实验室开放基金资助项目

摘　　要：研究了混合FlowShop的调度问题,调度目标为最小化工件的最大完成时间。文中给出了调度仿真系统的设计,系统由数据库、算法和控制中心用户接口三个模块组成;在算法模块中,排序算法包括了由FlowShop扩展到混合FlowShop的多数算法,设备分配采用最先可用机器优先规则。另外,基于CDS虚拟机和Palmer斜度指标的启发式算法,提出了一种改进的CDS算法用于工件排序。在正在开发的混合FlowShop调度仿真系统中实现了上述所有算法,仿真分析表明改进的CDS算法优于其他启发式算法。This paper studies the scheduling problem of hybrid flow shop under the objective of minimizing makespan. The design of scheduling simulation system is given in the paper. The system consists of three modules: database, algorithm and control center; in the algorithm module, numerous heuristic algorithms extended from flow shop are used to sort jobs, and then First Available Machine rule is applied to allocate parallel machines. In addition, the paper proposes a heuristic algorithm which is based on virtual machine and the slope index of Palmer to sequence jobs. Extensive experimentation with different problem sizes is conducted through the scheduling simulation system. The advantage of the algorithm proposed in this paper is demonstrated by both simulation results.

关 键 词：混合Flow SHOP 调度 启发式算法 最大完工时间 

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