摘要
针对混合流水车间 ( Hybrid Flowshop,HFS)最小化工件全部完成作业时间 ( Makespan)调度问题 ,提出混合整数规划模型 ,基于斜度指标的方法来对工件进行排序 ,采用最先空闲设备( FAM)算法来分配设备 ,并给出其最优值的下界以检验该算法 .仿真结果表明 ,该方法能够较好地解决混合
This paper presented a mixed integer program model of the minimizing makespan problem in hybrid flowshop. A heuristic algorithm is used to get a near optimal schedule, which first sequences jobs according the slope index, second allocates device for jobs by using the first available machine (FAM) rule. A lower bound was proposed to check this algorithm's deviation of the optimum makespan. The simulation result shows that the algorithm can get a good schedule for hybrid flowshop.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2002年第8期1155-1157,1160,共4页
Journal of Shanghai Jiaotong University
