期刊文献+

基于约束满足方法求解炼钢—连铸生产调度问题 被引量:9

Constraint Satisfaction-based Method for Steelmaking-Continuous Casting Production Scheduling Problem
下载PDF
导出
摘要 针对各阶段均有并行机的炼钢—连铸生产调度问题,建立了问题的约束满足模型.通过分析炼钢—连铸调度问题特点,将其归结为最小化操作开工时间偏移的调度问题.在求解过程中,首先用变量选择和值选择启发式方法构造时间可行的初始调度,然后应用冲突检查算法检测资源冲突,基于回跳的后向修剪组合算法修复冲突,直至得到一个一致性的最终解.数据实验表明本文提出的方法是有效的.* A constraint satisiaction model is established for steelmaking-continuous casting production scheduling problem with parallel machines in each processing stage. By analyzing the characteristics of the problem, we reduce it to a problem of minimizing the operation's starting time deviation. In the solving process, the temporal feasible initial schedule is constructed firstly by using variable selection and value selection heuristic, then the resource conflicts are checked by conflict checking algorithm and are repaired by backward pruning combinational algorithm until a consistent final solution is achieved. The validity of the proposed constraint satisfaction-based method is demonstrated by the data experiment.
出处 《信息与控制》 CSCD 北大核心 2005年第6期753-758,764,共7页 Information and Control
基金 国家自然科学基金资助项目(70371057)
关键词 约束满足 炼钢-连铸 生产调度 变量选择和值选择 冲突检查算法 后向修剪组合算法 constraint satisfaction steelmaking-continuous casting production scheduling variable selection and value selection conilict checking algorithm backward pruning combinational algorithm
  • 相关文献

参考文献12

  • 1Tang L, Liu J, Rong A, et al. A mathematical programming modelfor scheduling steelmaking-continuous casting production [ J ].European Journal of Operational Research, 2000, 120(2) : 423-435.
  • 2Harjunkoski I, Grossmann I E. A decomposition approach for the scheduling of a steel plant production [ J]. Computers and Chemical Engineering, 2001,25( 11 - 12) : 1647-1660.
  • 3刘光航,李铁克.炼钢-连铸生产调度模型及启发式算法[J].系统工程,2002,20(6):44-48. 被引量:29
  • 4Pacciarelli D, Pranzo M. Production scheduling in a steelmaking-continuous casting plant [ J]. Computers and Chemical Engineering, 2004, 28(12) : 2823 -2835.
  • 5Dechter R, Frost D. Backjump-based backtracking for constraint satisfaction problems [ J ]. Artificial Intelligence, 2002, 136(2) : 147 -188.
  • 6Minton S, Johnston M D, Philips A, et al. Minimizing conflicts:a heuristic repair method for constraint satisfaction and scheduling problems [J]. Artificial Intelligence, 1992, 58(1 -3): 161 -205.
  • 7Sakkout H E, Wallace M. Probe backtrack search for minimal perturbation in dynmnic scheduling [ J ]. Constraints, 2000, 5(4) : 359 -388.
  • 8Cesta A, Oddi A, Smith S F. A constraint-based method for project scheduling with time windows [ J ]. Journal of Heuristics,2002, 8(1) : 109 -136.
  • 9Beck J C, Refalo P. A hybrid approach to scheduling with earliness and tardiness costs [ J ]. Annals of Operations Research,2003, 118:49 -71.
  • 10Baptiste P, Pape C L, Nuijten W. Constraint-based Scheduling[M]. Boston, USA: Kluwer Academic Publishers, 2001.

二级参考文献3

共引文献28

同被引文献92

引证文献9

二级引证文献67

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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