柔性制造系统调度算法研究  

Research on the scheduling algorithms of FMS

作　　者：牛海军[1] 徐家辉[2] 

机构地区：[1]西安电子科技大学外部设备研究所,陕西西安710071 [2]信息产业部电子第15所,北京100083

出　　处：《西安电子科技大学学报》2002年第1期35-38,共4页Journal of Xidian University

基　　金：国家自然科学基金资助项目 (699840 0 4)

摘　　要：针对混合流程调度的特性 ,研究了两台并行可替换机床的调度问题 .在一个加工阶段内有两台机床并可相互替代加工 ,调度目标是使所有任务在这两台机床上的加工时间最短 ,这个问题已被证明为NP hard问题 .为此在分枝定界算法基础上提出了两个关于调度替换原则的推理 ,作为解决这类调度问题的基本原则 .根据这两个推理给出了如何在这种混合流程调度中对任务排序及指定加工机床的启发式调度算法 。This paper considers hybrid flow shop scheduling with two parallel machines at one stage, where a set of jobs needs processing on one of the two machines. Alternatives are available to allocate processors to process a job. Under a given alternative, a job is assigned to a specific processor, and requires correspondingly a specific processing time. Job preemption is not allows. To find a minimum makespan scheduling, which is strongly NP-hand, some efficient heuristics have been proposed in the literature. According to the characteristics of FMS, and based on the branch-and-bound algorithm, two theorems about the principle of alternatives are proposed. Furthermore, the heuristics scheduling algorithms about sequence and assigning the jobs on machines are developed for the hybrid flow-shop by using the two theorems. Finally, the computational experiments are conducted to illustrate the effectiveness of these algorithms. The heuristics scheduling algorithms are tested on problems with size of up to 120 jobs.

关 键 词：柔性制造系统 调度算法 计算机控制 

分 类 号：TH165[机械工程—机械制造及自动化]