期刊文献+

轧钢切断阶段动态HFS调度模型和LR算法研究 被引量:1

Model for Dynamic HFS Scheduling at Rolling Steel Cutting Stage and Research of Lagrangian Relaxation Algorithm
下载PDF
导出
摘要 以钢管生产为背景,在分析钢管切割工艺的基础上,提炼出第一阶段具有批处理特征的动态HFS调度问题,建立了数学规划模型,目标是最小化所有工件的加权完成时间.针对该模型,构造了改进的拉格朗日松弛算法(lagrangian relaxation,LR)的求解过程,设计了求解批级子问题的动态规划算法和构造可行解的启发式算法. Based on the background of steel-tube production,on the analysis of the technology of steel tube cutting,the dynamic hybrid flowshop scheduling with batch processing at the first stage was presented,and an integer programming model was established for this problem.The objective was to minimize the total weighted completion time.The improved Lagrangian relaxation algorithm was constructed to slove the developed model where the dynamic programming was designed to solve batch-level subproblems,and two-stage heuristic was presented to construct a feasible schedule.
作者 轩华 曹颖
出处 《郑州大学学报(理学版)》 CAS 北大核心 2012年第1期56-61,共6页 Journal of Zhengzhou University:Natural Science Edition
基金 国家自然科学基金资助项目 编号71001090 71001091 河南省教育厅自然科学研究计划项目 编号2009A120002
关键词 动态HFS调度 批处理 拉格朗日松弛 动态规划 dynamic hybrid flowshop scheduling batching production Lagrangian relaxation dynamic programming
  • 相关文献

参考文献11

  • 1Atighehchian A,Bijari M,Tarkesh H. A novel hybrid algorithm for scheduling steel-making continuous casting production[J].Computers and Operations Research,2009,(08):2450-2461.
  • 2Tang Lixin,Luh P B,Liu Jiyin. Steel-making process scheduling using Lagrangian relaxation[J].International Journal of Production Research,2002,(01):55-70.
  • 3Li Dawei,Wang Li,Wang Mengguang. Genetic algorithm for production lot planning of steel pipe[J].Production Planning and Control,1999,(01):54-57.doi:10.1080/095372899233424.
  • 4Xuan Hua. A Lagrangian relaxation algorithm for the order planning of steel pipe[A].2009.685-688.
  • 5Xuan Hua,Tang Lixin. Scheduling a hybrid flowshop with batch production at the last stage[J].Computers and Operations Research,2007,(09):2718-2733.doi:10.1016/j.cor.2005.10.014.
  • 6Ruiz R,Vazquez-Rodriguez J A. The hybrid flow shop scheduling problem[J].European Journal of Operational Research,2010.1-18.
  • 7Hoitomt D J,Luh P B,Pattipati K R. A practical approach to job-shop scheduling problems[J].IEEE Transactions on Robotics and Automation,1993,(01):1-13.doi:10.1109/70.210791.
  • 8Oguz C,Tang L. A Lagrangian relaxation method for hybrid flow-shop scheduling with multiprocessor tasks to minimize total weighted completion time[A].Nottingham,2003.638-653.
  • 9Abdul-Razaq T S,Potts C N,Van Wassenhove L N. A survey of algorithms for the single machine total weighted tardiness scheduling problem[J].Discrete Applied Mathematics,1990,(2/3):235-253.
  • 10Chen Haoxun,Chu Chengbin,Proth J M. An improvement of the Lagrangean relaxation approach for job shop scheduling:a dynamic programming method[J].IEEE Transactions on Robotics and Automation,1998,(05):786-795.doi:10.1109/70.720354.

同被引文献4

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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