双机无等待流水作业调度算法研究  

No-wait Scheduling of a Two-machine Flow-shop

作　　者：陆超[1] 王丽亚[1] 

机构地区：[1]上海交通大学机械与动力工程学院,上海200240

出　　处：《工业工程与管理》2012年第1期32-35,共4页Industrial Engineering and Management

摘　　要：考虑双机无等待流水作业调度问题,此问题中每台机器都受一个非可用时间的约束,工件都有不同的释放时间。机器的非可用性时间间隔是部分重叠并且已知。目标使Makespan(最大流程时间)最小。通过不同的方式计算上限和下限,完善分支定界法。计算机实验结果显示了所述方法的有效性。In this paper,we consider the two-machine no-wait flow-shop scheduling problem,when each machine is subject to one non-availability constraint and jobs have different release dates.The non-availability intervals of the machines overlap and they are known in advance.We aim to find a non-resumable schedule that can minimize the makespan.We propose several lower bounds and upper bounds.These bounding procedures are used in a branch-and-bound algorithm.Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.

关 键 词：流水作业调度 遗传算法 贪婪搜索 

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