期刊文献+

顺序依赖的调整时间和拖期的无缝钢管热轧批量调度算法 被引量:1

Hot-rolled batch scheduling algorithm for seamless steel tube with sequence-dependent setup times and tardiness
原文传递
导出
摘要 无缝钢管热轧生产存在一类特殊的顺序依赖机器调整时间,调整时间依赖于相邻轧制批量间的规格切换,与批量间规格呈线性函数关系.针对具有此类调整时间的热轧批量调度问题,进一步考虑交货期要求,探讨了调整时间与交货期之间的性质特征,并以最小化总机器调整时间和最小化总拖期为目标,基于进化算法框架设计了快速重排序邻域搜索多目标算法(fast reordering neighborhood search multi-objective algorithm,FRNSM).在算法初始阶段,提出规格优化规则和交货时间优化规则,对初始解进行局部优化;邻域搜索阶段设计了基于同交货时间规格优化的快速重排序邻域搜索策略,以优化机器调整时间和拖期;针对问题多目标特征,基于Pareto思想设计解的接受准则.基于实际生产数据的实验结果表明,FRNSM算法对此类问题具有很好的求解效果. There is a special type of machine sequence-dependent setup times existed in hot-rolled seamless steel tube production,which depends on the difference in specifications between adjacent batches,and has a linear function relationship with batch specification.For this kind of hot-rolled batch scheduling problems with sequence-dependent setup times,the constraint of order delivery requirements is further considered,and the property between adjustment time and delivery time is explored.Aiming at minimizing the total adjustment time and tardiness,a fast reordering neighborhood search multi-objective algorithm(FRNSM)is designed based on evolutionary algorithms.At initial stage of the algorithm,based on the characteristic of sequence-dependent setup times,the specification optimization rule and delivery time optimization rule are proposed to locally optimize the initial solution.At the neighborhood search stage,the fast reordering neighborhood search strategy is designed based on the specification optimization between the same delivery time to optimize the setup times and tardiness;for the problem with multiple objectives,the acceptance criteria of solution is designed based on the Pareto improvement strategy.The experimental results based on actual production data show that the FRNSM has obvious effect on solving this kind of problems.
作者 汪洋 李铁克 王柏琳 WANG Yang;LI Tie-ke;WANG Bai-lin(School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China;Engineering Research Center of MESTechnology for Iron&Steel Production of Ministry of Education,Beijing 100083,China)
出处 《控制与决策》 EI CSCD 北大核心 2021年第2期505-512,共8页 Control and Decision
基金 国家自然科学基金项目(71231001,71701016) 北京市自然科学基金项目(9174038) 教育部人文社会科学研究青年基金项目(17YJC630143) 中央高校基本科研业务费项目(FRF-BD-18-009A).
关键词 无缝钢管 热轧批量计划 多目标优化 机器调整时间 拖期 快速重排序搜索策略 seamless steel tube hot-rolled batch planning multi-objective optimization setup times tardiness fast reordering search strategy
  • 相关文献

参考文献3

二级参考文献25

  • 1李耀华,王伟,徐乐江,宁树实,张大波.热轧生产轧制计划模型与算法研究[J].控制与决策,2005,20(3):275-279. 被引量:21
  • 2孙玲,李铁克.炼钢-连铸-热轧批量计划的约束满足算法[J].计算机集成制造系统,2007,13(5):940-944. 被引量:15
  • 3Kosiba E D,Wright J R,Cobbs A E.Discrete event sequencing as a traveling salesman problem[J].Computers in Industry,1992,19(2):317-327.
  • 4Lopez L,Carter W M,Gendreau M.The hot strip mill production scheduling problem:A tabu search approach[J].European J of Operational Research,1998,106(2):317-335.
  • 5Tang L,Liu Jiyin,Rong A,et al.A multiple traveling salesman problem model for hot rolling scheduling in shanghai baoshan iron and steel complex[J].European J of Operational Research,2000,124(2):267-282.
  • 6Taillard E,Badeau P,Gendreau M,et al.A tabu search heuristic for the vehicle routing problem with soft time windows[J].Trans Science,1997,31(1):170-186.
  • 7Dantzig G,Ramser J.The truck dispatching problem[J].Management Science,1959,10(6):80-91.
  • 8Brailsford S C,Potts C N,Smith B M.Invited review:Constraint satisfaction problems:Algorithms and applications[J].European J of Operational Research,1999,119(3):57-581.
  • 9Baptiste P,Pape C L,Nuijten W.Constraint-based scheduling[M].Boston:Kluwer Academic Publishers,2001.
  • 10Sadeh N,Fox M S.Variable and value ordering heuristics for job shop scheduling constraints satisfaction problem[J].Artificial Intelligence,1996,86(11):455-480.

共引文献26

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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