期刊文献+

带连续式批处理机的可重入混合流水车间调度 被引量:2

Re-entrant hybrid flow shop scheduling problem with continuous batch processing machines
下载PDF
导出
摘要 为了解决冷拔无缝钢管生产周期长、能源消耗高的问题,实现生产调度的智能化、绿色化,研究了带连续式批处理机的可重入混合流水车间调度问题。首先考虑批处理机缓冲区的影响,构建了调度优化模型;然后设计了改进的基于分解的多目标进化算法用于该问题,提出了基于工序的编码方案和均衡考虑完工时间与能耗的解码方案,根据多样性指标的高低设计了局部搜索和多样性增强策略,并通过对最优解局部搜索来提高解的多样性;最后,通过对不同算例的实验,验证了所提算法可以高效地求解带连续式批处理机的可重入混合流水车间调度问题。 To solve the problem of long production cycle and high energy consumption in the production of cold-drawn seamless steel pipes and to realize the intelligent and green scheduling,the re-entrant hybrid flow shop scheduling problem with continuous batch processing machines(RHFSP-CBPM)was studied.A mathematical model was formulated with considering the buffer of the batch processing machines.Then,an Improved Multi-Objective Evolutionary Algorithm based on Decomposition(IMOEA/D)was developed to solve the problem,and an operation-based encoding method and a balanced decoding method were proposed.A local search strategy and diversity enhancement strategy were designed according to the diversity metrics,and the diversity of Pareto solutions was improved by local searching.The numerical experiments were carried out and the results showed that the proposed model and the developed algorithm could solve the proposed problem effectively.
作者 吴秀丽 曹铮 WU Xiuli;CAO Zheng(School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2022年第11期3365-3378,共14页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(52175449) 国家重点研发计划资助项目(2020YFB1712902)。
关键词 混合流水车间调度 可重入 连续式批处理机 缓冲区 改进的基于分解的多目标进化算法 hybrid flow shop scheduling re-entrant continuous batch processing machine buffer improved multi-objective evolutionary algorithm based on decomposition
  • 相关文献

参考文献11

二级参考文献93

  • 1赵玉芳,唐立新.极小化最大完工时间的单机连续型批调度问题[J].自动化学报,2006,32(5):730-737. 被引量:18
  • 2张怀,江志斌,郭乘涛.面向瓶颈的半导体晶圆制造系统派工策略及参数优化[J].上海交通大学学报,2007,41(8):1252-1257. 被引量:10
  • 3Tang G C, Zhang F, Luo S C, Liu L L. Theory of Modern Scheduling. Shanghai: Shanghai Popular Science Press, 2003. 83-113
  • 4Ikura Y, Gimple M. Scheduling algorithms for a single batch processing machine. Operations Research Letters, 1986, 5(1): 61-65
  • 5Ahmadi J H, Ahmadi R H, Dasu S, Tang C S. Batching and scheduling jobs on batch and discrete processors. Operations Research, 1992, 40(4): 750-763
  • 6Lee C Y, Uzsoy R, Martin-Vega L A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 1992, 40(4): 764-775
  • 7Uzsoy R, Lee C Y, Martin-Vega L A. Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics, 1992, 39(3): 369-388
  • 8Brucker P, Garey N R, Johnson D S. Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness. Mathematics of Operations Research, 1977, 2(2): 275-284
  • 9Lee C Y, Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 1999, 37(1): 219 -236
  • 10Hochbaum D S, Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime Operations Research, 1997, 45(6): 874-885

共引文献66

同被引文献11

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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