期刊文献+

基于离散粒子群优化的轧辊热处理调度方法 被引量:8

Roller annealing scheduling method based on discrete particle swarm optimization
下载PDF
导出
摘要 以某轧辊企业铸钢分厂的轧辊热处理调度问题为实际背景,研究了两阶段及三阶段无等待混合流水车间调度问题.针对问题中工件加工无等待特点,设计了分阶段实现的无等待算法;在此基础上,结合离散粒子群优化算法对建立的整数规划模型进行优化求解.通过对真实数据仿真实验所得结果的比较与分析,验证了算法的可行性和有效性,并给出了具有实际参考价值的设备改进策略,对生产决策者合理安排生产具有一定的指导意义. A two-stage and three-stage no-wait hybrid flow shop (NWHFS) scheduling problem is considered against a background of the scheduling problem of roller annealing operation in cast steel plant of a roller corporation. For the no-wait constraint between two sequential operations of a job, the no-wait algorithm of grading (NWAG) is designed. On this basis, we tried to combine NWAG with the discrete particle swarm optimization (DPSO) algorithm to solve the built integer programming model. In the simulation experiment with the real data, the feasibility and the effectiveness of the algorithm are demonstrated by the comparisons and analyses of results, and the equipment reformation strategies of actual reference value are given as well which is beneficial for the policy-maker to arrange production reasonably.
出处 《管理科学学报》 CSSCI 北大核心 2010年第6期44-53,共10页 Journal of Management Sciences in China
基金 国家自然科学基金资助项目(70721001 70625001) 教育部新世纪优秀人才支持计划资助项目(NCET-04-280)
关键词 轧辊热处理 无等待混合流水车间 离散粒子群优化算法 分阶段无等待算法 annealing operation of roller no-wait hybrid flow shop DPSO no-wait algorithm of grading
  • 相关文献

参考文献15

  • 1Hung-Tso Lin,Ching-Jong Liao.A case study in a two-stage hybrid flow shop with setup time and dedicated machines[J].International Journal of Production Economics,2003,86(2):133-143.
  • 2Hua Xuan,Lixin Tang.Scheduling a hybrid flowshop with batch production at the last stage[J].Computer & Operations Research,2007,34(9):2718-2733.
  • 3Chen Lu,et al.A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal[J].European Journal of Operational Research,2007,181(1):40-58.
  • 4Santos D L,Hunsucker J L,Deal D E.Global lower bounds for flow shops with multiple processors[J].European Journal of Operational Research,1995,80(1):112-120.
  • 5Moursli O,Pochet Y.A branch-and-bound algorithm for the hybrid flowshop[J].International Journal of Production Economics,2000,64(1-3):113-125.
  • 6Rajendran C,Chaudhuri D.Scheduling in n-job,m-stage flowshop with parallel processors to minimize makespan[J].International Journal of Production Economics,1992,27(2):137-143.
  • 7Gupta J N D.Two-stage hybrid flowshop scheduling problem[J].Journal of the Operational Research Society,1988,39(4):359-364.
  • 8轩华,唐立新.实时无等待HFS调度的一种拉格朗日松弛算法[J].控制与决策,2006,21(4):376-380. 被引量:25
  • 9Wang Zhen-bo,Xing Wen-xun,Bai Feng-shan.No-wait flexible flow shop scheduling with no-idle machines[J].Operations Research Letters,2005,33(6):609-614.
  • 10Guirchoun S,Martineau P,Billaut J-C.Total completion time minimization in a computer system with a server and two parallel processors[J].Computers & Operations Research,2005,32(3):599-611.

二级参考文献111

共引文献55

同被引文献125

引证文献8

二级引证文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部