期刊文献+

轧辊热处理过程中具有组批的并行机调度问题 被引量:2

On the Batch Loading and Parallel Scheduling Problem During Roller Heat-Treatment
下载PDF
导出
摘要 研究了在轧辊热处理过程中加热炉体积相同的情况下,具有组批的并行机调度问题.以使最长完成时间最小化为目标建立了该问题的数学模型.提出了辊坯组批启发式算法和批次调度启发式算法,并将二者结合形成了一个两阶段启发式算法,对模型进行求解.通过对实验结果的比较与分析,验证了方法的有效性.针对不同规模的问题给出了相应的最优求解方法,提高了轧辊的生产效率,为决策者合理安排生产提供了有效的策略. The batch loading and parallel scheduling(BLPS) with the identical heating furnace for roller heat-treatment was considered for the relevant cast steel plant. A mathematical model of BLPS was developed to minimize makespan.Then,a two-stage heuristic algorithm was proposed combining both the heuristic algorithms for roll billet batching and batch scheduling together,thus solving the model.The effectiveness of the method has been verified in comparison with simulation results.Furthermore,the solution to the BLPS problem is optimized on different scales to improve the productivity of rollers,which will benefit the decision-makers by scheduling the roll production reasonably.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2010年第8期1089-1092,共4页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(70721001 70625001) 教育部新世纪优秀人才支持计划项目(NCET-04-280)
关键词 轧辊热处理 辊坯组批 批次调度 并行机 启发式算法 roller heat-treatment roller billet batching batch scheduling parallel machines heuristic algorithm
  • 相关文献

参考文献7

  • 1Biskup D, Herrmann J, Gupta J N D. Scheduling identical parallel machines to minimize total tardiness[J]. International Journal of Production Economics, 2008,115 (1) : 134 - 142.
  • 2Li K, Yang S L. Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms [ J ]. Applied Matherr~tical Modeling, 2009,33(4) :2145 - 2158.
  • 3衣扬,汪定伟.并行多机成组工件调度的启发式算法[J].东北大学学报(自然科学版),2001,22(1):9-16. 被引量:3
  • 4Tang L X, Gong H. A hybrid two-stage transportation and batch scheduling problem [ J ]. Applied Mathematical Modeling, 2008,32(12) :2467 - 2479.
  • 5Yuan J J, Qi X L, Lu L F, et al. Single machine unbounded parallel-batch scheduling with forbidden intervals [ J ]. European Journal of Operational Research, 2008, 186 (3) : 1212 - 1217.
  • 6Lu L F, Cheng T C E, Yuan J J, et al. Bounded singlemachine parallel-batch scheduling with release dates and rejection[J]. Computers & Operations Research, 2009,36 (10) : 2748 - 2751.
  • 7Song J W, Tang J F. Scheduling model and discrete particle swarm optimization algorithm for miler annealing[C]//2008 Asia Simulation Conference-7th International Conference on System Simulation and Scientific Computing. New York: IEEE, 2008 : 770 - 775.

二级参考文献1

共引文献2

同被引文献53

  • 1罗家祥,唐立新.带释放时间的并行机调度问题的ILS & SS算法[J].自动化学报,2005,31(6):917-924. 被引量:8
  • 2李鹏,刘民,吴澄.一类并行机调度问题的动态调度算法[J].计算机集成制造系统,2007,13(3):568-572. 被引量:7
  • 3王凌,刘波.微粒群优化与调度算法[M].北京:清华大学出版社,2011.
  • 4Creemers S, Lambrecht M. Modeling a hospital queueing network[ J ]. International Series in Operations Research & Management Science ,2011,154:767 - 798.
  • 5Filipowicz B, Kwiecien J. Queueing systems and networks, models and applications [ J ]. Bulletin of the Polish Academy of Science: Technical Science, 2008,56 (4) :379 - 390.
  • 6Au-Yeung S W M, Harrison P G, Knottenbelt W J. A queueing network model of patient flow in an accident and emergency department [ C]//20th Annual European Conference on Modeling and Simulation. Bonn, 2006 : 60 - 67.
  • 7Jlassi J, Mharnedi A E, Chabchoub H. Networks of queues with multiple customer types: application in emergency department [ J]. International Journal of Behavioural and Healthcare Research,2009,1 (4) :400 - 419.
  • 8Abadi K, Hall N G, Sdskandarajah C. Minimizing cycle time in a blocking flowshop [ J ]. Operation Research, 2000,48 (1) :177 -180.
  • 9Balsamo S,de Nitro Persone' V, Onvural R. Analysis of queueing networks with blocking [ M ]. Boston: Kluwer Academic Publishers ,2001.
  • 10Dallery Y, Frein Y. On decomposition methods for tandem queuing networks with blocking [ J ]. Operation Research, 1993,41 (2) :386 - 399.

引证文献2

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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