期刊文献+

基于斜度指标的混合流水车间调度方法 被引量:4

Slope Index for Hybrid Flowshop Scheduling Problem
下载PDF
导出
摘要 针对混合流水车间 ( 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
关键词 斜度指标 混合流水车间 调度方法 下界值 工件全部作业时间 混合整数规划模型 设备分配 启发式算法 hybrid flowshop (HFS) slope index lower bound makespan scheduling
  • 引文网络
  • 相关文献

参考文献7

  • 1[1]Narasimhan S, Mangiameli P. A comparison of sequencing rules for two-stage hybrid flow shop [J]. Decision Science, 1987,18:250-265.
  • 2[2]Gupta J N D. Two-stage hybrid Flowshop scheduling problem [J]. Operational Research Society, 1988, 39(4):359-364.
  • 3[3]Sriskandarajah C, Sethi S P. Scheduling algorithms for flexible flowshops: worst and average case performance [J]. European Journal of Operational Research, 1989,43:143-160.
  • 4[4]Brah S A, Hunsucker J L. Branch and bound algorithm for the flow shop with multiprocessors [J]. European Journal of Operational Research, 1991, 51:88-89.
  • 5[5]Guinet A. Scheduling hybrid flowshops to minimize maximum tradiness or maximum completion time [J]. International Journal of Production Research, 1996,34:1643-1654.
  • 6[6]Palmer D. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum [J]. Operations Research Quarterly, 1965,16: 101-107.
  • 7[7]Hunsucker J L, Shah J R. Comparative performance analysis of priority rules in a constrained flow shop with multiple processor environment [J]. European Journal of Operational Research, 1994,72: 102-104.

同被引文献39

  • 1胡燕海,严隽琪,叶飞帆.基于遗传算法的混合流水车间构建方法[J].中国机械工程,2005,16(10):888-891. 被引量:7
  • 2吴涛,陈荣秋.冷卷热处理生产调度模型的启发式算法[J].华中科技大学学报(自然科学版),2006,34(10):58-60. 被引量:3
  • 3李淑霞,单鸿波.一种具有免疫机制的车间调度遗传算法[J].东华大学学报(自然科学版),2006,32(5):36-39. 被引量:1
  • 4余建军,孙树栋,王军强,杜先进.免疫模拟退火算法及其在柔性动态Job Shop中的应用[J].中国机械工程,2007,18(7):793-799. 被引量:15
  • 5[1]Guinet A G P, Solomon M M. Scheduling hybrid flowshop to minimize maximum tardiness or maximum completion time [J]. International Journal of Production Research, 1996, 34: 1643-1654.
  • 6[2]Fouad Riane. Hybrid three-stage flowshop problem:Efficient heuristics to minimize makespan [J]. European Journal of Operational Research, 1998, 109: 321-329.
  • 7[3]Mohamed Haouari. Heuristic algorithms for the two-stage hybrid flowshop problem [J]. Operations Research Letters, 1997, 21: 43-53.
  • 8[4]Campbell H G, Dudek R A, Smith H L. A heuristic algorithm for the n-job m-machine sequencing problem [Z]. Management Science 1970, 16: 630-637.
  • 9[5]Palmer D S. Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum [J]. Operations Research Quarterly, 1965, 16(1): 101-107.
  • 10[6]Hundal, Tejpal S, Rajqopal, Jayant. Extension of Palmer's heuristic for the flowshop scheduling problem [J]. International Journal of Production Research, 1988, 26(6): 1119-1124.

引证文献4

二级引证文献29

;
使用帮助 返回顶部